Search (17 results, page 1 of 1)

Zheng, R.; Li, J.; Chen, H.; Huang, Z.: ¬A framework for authorship identification of online messages : writing-style features and classification techniques (2006) 0.06
```
0.055243753 = product of:
  0.110487506 = sum of:
    0.110487506 = sum of:
      0.07512515 = weight(_text_:online in 5276) [ClassicSimilarity], result of:
        0.07512515 = score(doc=5276,freq=16.0), product of:
          0.15842392 = queryWeight, product of:
            3.0349014 = idf(docFreq=5778, maxDocs=44218)
            0.05220068 = queryNorm
          0.47420335 = fieldWeight in 5276, product of:
            4.0 = tf(freq=16.0), with freq of:
              16.0 = termFreq=16.0
            3.0349014 = idf(docFreq=5778, maxDocs=44218)
            0.0390625 = fieldNorm(doc=5276)
      0.035362355 = weight(_text_:22 in 5276) [ClassicSimilarity], result of:
        0.035362355 = score(doc=5276,freq=2.0), product of:
          0.18279788 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05220068 = queryNorm
          0.19345059 = fieldWeight in 5276, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0390625 = fieldNorm(doc=5276)
  0.5 = coord(1/2)
```
Abstract

With the rapid proliferation of Internet technologies and applications, misuse of online messages for inappropriate or illegal purposes has become a major concern for society. The anonymous nature of online-message distribution makes identity tracing a critical problem. We developed a framework for authorship identification of online messages to address the identity-tracing problem. In this framework, four types of writing-style features (lexical, syntactic, structural, and content-specific features) are extracted and inductive learning algorithms are used to build feature-based classification models to identify authorship of online messages. To examine this framework, we conducted experiments on English and Chinese online-newsgroup messages. We compared the discriminating power of the four types of features and of three classification techniques: decision trees, backpropagation neural networks, and support vector machines. The experimental results showed that the proposed approach was able to identify authors of online messages with satisfactory accuracy of 70 to 95%. All four types of message features contributed to discriminating authors of online messages. Support vector machines outperformed the other two classification techniques in our experiments. The high performance we achieved for both the English and Chinese datasets showed the potential of this approach in a multiple-language context.

Date

22. 7.2006 16:14:37
Chen, H.; Beaudoin, C.E.; Hong, H.: Teen online information disclosure : empirical testing of a protection motivation and social capital model (2016) 0.02
```
0.023904676 = product of:
  0.04780935 = sum of:
    0.04780935 = product of:
      0.0956187 = sum of:
        0.0956187 = weight(_text_:online in 3203) [ClassicSimilarity], result of:
          0.0956187 = score(doc=3203,freq=18.0), product of:
            0.15842392 = queryWeight, product of:
              3.0349014 = idf(docFreq=5778, maxDocs=44218)
              0.05220068 = queryNorm
            0.6035623 = fieldWeight in 3203, product of:
              4.2426405 = tf(freq=18.0), with freq of:
                18.0 = termFreq=18.0
              3.0349014 = idf(docFreq=5778, maxDocs=44218)
              0.046875 = fieldNorm(doc=3203)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
```
Abstract

With bases in protection motivation theory and social capital theory, this study investigates teen and parental factors that determine teens' online privacy concerns, online privacy protection behaviors, and subsequent online information disclosure on social network sites. With secondary data from a 2012 survey (N?=?622), the final well-fitting structural equation model revealed that teen online privacy concerns were primarily influenced by parental interpersonal trust and parental concerns about teens' online privacy, whereas teen privacy protection behaviors were primarily predicted by teen cost-benefit appraisal of online interactions. In turn, teen online privacy concerns predicted increased privacy protection behaviors and lower teen information disclosure. Finally, restrictive and instructive parental mediation exerted differential influences on teens' privacy protection behaviors and online information disclosure.
Huang, C.; Fu, T.; Chen, H.: Text-based video content classification for online video-sharing sites (2010) 0.02
```
0.016265072 = product of:
  0.032530144 = sum of:
    0.032530144 = product of:
      0.06506029 = sum of:
        0.06506029 = weight(_text_:online in 3452) [ClassicSimilarity], result of:
          0.06506029 = score(doc=3452,freq=12.0), product of:
            0.15842392 = queryWeight, product of:
              3.0349014 = idf(docFreq=5778, maxDocs=44218)
              0.05220068 = queryNorm
            0.41067213 = fieldWeight in 3452, product of:
              3.4641016 = tf(freq=12.0), with freq of:
                12.0 = termFreq=12.0
              3.0349014 = idf(docFreq=5778, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3452)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
```
Abstract

With the emergence of Web 2.0, sharing personal content, communicating ideas, and interacting with other online users in Web 2.0 communities have become daily routines for online users. User-generated data from Web 2.0 sites provide rich personal information (e.g., personal preferences and interests) and can be utilized to obtain insight about cyber communities and their social networks. Many studies have focused on leveraging user-generated information to analyze blogs and forums, but few studies have applied this approach to video-sharing Web sites. In this study, we propose a text-based framework for video content classification of online-video sharing Web sites. Different types of user-generated data (e.g., titles, descriptions, and comments) were used as proxies for online videos, and three types of text features (lexical, syntactic, and content-specific features) were extracted. Three feature-based classification techniques (C4.5, Naïve Bayes, and Support Vector Machine) were used to classify videos. To evaluate the proposed framework, user-generated data from candidate videos, which were identified by searching user-given keywords on YouTube, were first collected. Then, a subset of the collected data was randomly selected and manually tagged by users as our experiment data. The experimental results showed that the proposed approach was able to classify online videos based on users' interests with accuracy rates up to 87.2%, and all three types of text features contributed to discriminating videos. Support Vector Machine outperformed C4.5 and Naïve Bayes techniques in our experiments. In addition, our case study further demonstrated that accurate video-classification results are very useful for identifying implicit cyber communities on video-sharing Web sites.

Dumais, S.; Chen, H.: Hierarchical classification of Web content (2000) 0.02

0.015936451 = product of:
  0.031872902 = sum of:
    0.031872902 = product of:
      0.063745804 = sum of:
        0.063745804 = weight(_text_:online in 492) [ClassicSimilarity], result of:
          0.063745804 = score(doc=492,freq=2.0), product of:
            0.15842392 = queryWeight, product of:
              3.0349014 = idf(docFreq=5778, maxDocs=44218)
              0.05220068 = queryNorm
            0.40237486 = fieldWeight in 492, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.0349014 = idf(docFreq=5778, maxDocs=44218)
              0.09375 = fieldNorm(doc=492)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Theme: Klassifikationssysteme im Online-Retrieval

Chen, H.; Dhar, V.: Cognitive process as a basis for intelligent retrieval system design (1991) 0.02

0.01502503 = product of:
  0.03005006 = sum of:
    0.03005006 = product of:
      0.06010012 = sum of:
        0.06010012 = weight(_text_:online in 3845) [ClassicSimilarity], result of:
          0.06010012 = score(doc=3845,freq=4.0), product of:
            0.15842392 = queryWeight, product of:
              3.0349014 = idf(docFreq=5778, maxDocs=44218)
              0.05220068 = queryNorm
            0.37936267 = fieldWeight in 3845, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.0349014 = idf(docFreq=5778, maxDocs=44218)
              0.0625 = fieldNorm(doc=3845)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract: 2 studies were conducted to investigate the cognitive processes involved in online document-based information retrieval. These studies led to the development of 5 computerised models of online document retrieval. These models were incorporated into a design of an 'intelligent' document-based retrieval system. Following a discussion of this system, discusses the broader implications of the research for the design of information retrieval sysems

Huang, Z.; Chung, Z.W.; Chen, H.: ¬A graph model for e-commerce recommender systems (2004) 0.01
```
0.013801372 = product of:
  0.027602743 = sum of:
    0.027602743 = product of:
      0.055205487 = sum of:
        0.055205487 = weight(_text_:online in 501) [ClassicSimilarity], result of:
          0.055205487 = score(doc=501,freq=6.0), product of:
            0.15842392 = queryWeight, product of:
              3.0349014 = idf(docFreq=5778, maxDocs=44218)
              0.05220068 = queryNorm
            0.34846687 = fieldWeight in 501, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.0349014 = idf(docFreq=5778, maxDocs=44218)
              0.046875 = fieldNorm(doc=501)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
```
Abstract

Information overload on the Web has created enormous challenges to customers selecting products for online purchases and to online businesses attempting to identify customers' preferences efficiently. Various recommender systems employing different data representations and recommendation methods are currently used to address these challenges. In this research, we developed a graph model that provides a generic data representation and can support different recommendation methods. To demonstrate its usefulness and flexibility, we developed three recommendation methods: direct retrieval, association mining, and high-degree association retrieval. We used a data set from an online bookstore as our research test-bed. Evaluation results showed that combining product content information and historical customer transaction information achieved more accurate predictions and relevant recommendations than using only collaborative information. However, comparisons among different methods showed that high-degree association retrieval did not perform significantly better than the association mining method or the direct retrieval method in our test-bed.
Chen, H.; Yim, T.; Fye, D.: Automatic thesaurus generation for an electronic community system (1995) 0.01
```
0.011501143 = product of:
  0.023002286 = sum of:
    0.023002286 = product of:
      0.04600457 = sum of:
        0.04600457 = weight(_text_:online in 2918) [ClassicSimilarity], result of:
          0.04600457 = score(doc=2918,freq=6.0), product of:
            0.15842392 = queryWeight, product of:
              3.0349014 = idf(docFreq=5778, maxDocs=44218)
              0.05220068 = queryNorm
            0.29038906 = fieldWeight in 2918, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.0349014 = idf(docFreq=5778, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2918)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
```
Abstract

Reports an algorithmic approach to the automatic generation of thesauri for electronic community systems. The techniques used included terms filtering, automatic indexing, and cluster analysis. The testbed for the research was the Worm Community System, which contains a comprehensive library of specialized community data and literature, currently in use by molecular biologists who study the nematode worm. The resulting worm thesaurus included 2709 researchers' names, 798 gene names, 20 experimental methods, and 4302 subject descriptors. On average, each term had about 90 weighted neighbouring terms indicating relevant concepts. The thesaurus was developed as an online search aide. Tests the worm thesaurus in an experiment with 6 worm researchers of varying degrees of expertise and background. The experiment showed that the thesaurus was an excellent 'memory jogging' device and that it supported learning and serendipitous browsing. Despite some occurrences of obvious noise, the system was useful in suggesting relevant concepts for the researchers' queries and it helped improve concept recall. With a simple browsing interface, an automatic thesaurus can become a useful tool for online search and can assist researchers in exploring and traversing a dynamic and complex electronic community system

Theme

Verbale Doksprachen im Online-Retrieval
Chen, H.: Explaining and alleviating information management indeterminism : a knowledge-based framework (1994) 0.01
```
0.0106243 = product of:
  0.0212486 = sum of:
    0.0212486 = product of:
      0.0424972 = sum of:
        0.0424972 = weight(_text_:online in 8221) [ClassicSimilarity], result of:
          0.0424972 = score(doc=8221,freq=2.0), product of:
            0.15842392 = queryWeight, product of:
              3.0349014 = idf(docFreq=5778, maxDocs=44218)
              0.05220068 = queryNorm
            0.2682499 = fieldWeight in 8221, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.0349014 = idf(docFreq=5778, maxDocs=44218)
              0.0625 = fieldNorm(doc=8221)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
```
Abstract

Attempts to identify the nature and causes of information management indeterminism in an online research environment and proposes solutions for alleviating this indeterminism. Conducts two empirical studies of information management activities. The first identified the types and nature of information management indeterminism by evaluating archived text. The second focused on four sources of indeterminism: subject area knowledge, classification knowledge, system knowledge, and collaboration knowledge. Proposes a knowledge based design for alleviating indeterminism, which contains a system generated thesaurus and an inferencing engine

Chung, W.; Chen, H.: Browsing the underdeveloped Web : an experiment on the Arabic Medical Web Directory (2009) 0.01

0.010608707 = product of:
  0.021217413 = sum of:
    0.021217413 = product of:
      0.042434826 = sum of:
        0.042434826 = weight(_text_:22 in 2733) [ClassicSimilarity], result of:
          0.042434826 = score(doc=2733,freq=2.0), product of:
            0.18279788 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05220068 = queryNorm
            0.23214069 = fieldWeight in 2733, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046875 = fieldNorm(doc=2733)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date: 22. 3.2009 17:57:50

Carmel, E.; Crawford, S.; Chen, H.: Browsing in hypertext : a cognitive study (1992) 0.01

0.008840589 = product of:
  0.017681178 = sum of:
    0.017681178 = product of:
      0.035362355 = sum of:
        0.035362355 = weight(_text_:22 in 7469) [ClassicSimilarity], result of:
          0.035362355 = score(doc=7469,freq=2.0), product of:
            0.18279788 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05220068 = queryNorm
            0.19345059 = fieldWeight in 7469, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0390625 = fieldNorm(doc=7469)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Source: IEEE transactions on systems, man and cybernetics. 22(1992) no.5, S.865-884

Leroy, G.; Chen, H.: Genescene: an ontology-enhanced integration of linguistic and co-occurrence based relations in biomedical texts (2005) 0.01

0.008840589 = product of:
  0.017681178 = sum of:
    0.017681178 = product of:
      0.035362355 = sum of:
        0.035362355 = weight(_text_:22 in 5259) [ClassicSimilarity], result of:
          0.035362355 = score(doc=5259,freq=2.0), product of:
            0.18279788 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05220068 = queryNorm
            0.19345059 = fieldWeight in 5259, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5259)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date: 22. 7.2006 14:26:01

Hu, D.; Kaza, S.; Chen, H.: Identifying significant facilitators of dark network evolution (2009) 0.01

0.008840589 = product of:
  0.017681178 = sum of:
    0.017681178 = product of:
      0.035362355 = sum of:
        0.035362355 = weight(_text_:22 in 2753) [ClassicSimilarity], result of:
          0.035362355 = score(doc=2753,freq=2.0), product of:
            0.18279788 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05220068 = queryNorm
            0.19345059 = fieldWeight in 2753, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2753)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date: 22. 3.2009 18:50:30

Fu, T.; Abbasi, A.; Chen, H.: ¬A hybrid approach to Web forum interactional coherence analysis (2008) 0.01
```
0.0079682255 = product of:
  0.015936451 = sum of:
    0.015936451 = product of:
      0.031872902 = sum of:
        0.031872902 = weight(_text_:online in 1872) [ClassicSimilarity], result of:
          0.031872902 = score(doc=1872,freq=2.0), product of:
            0.15842392 = queryWeight, product of:
              3.0349014 = idf(docFreq=5778, maxDocs=44218)
              0.05220068 = queryNorm
            0.20118743 = fieldWeight in 1872, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.0349014 = idf(docFreq=5778, maxDocs=44218)
              0.046875 = fieldNorm(doc=1872)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
```
Abstract

Despite the rapid growth of text-based computer-mediated communication (CMC), its limitations have rendered the media highly incoherent. This poses problems for content analysis of online discourse archives. Interactional coherence analysis (ICA) attempts to accurately identify and construct CMC interaction networks. In this study, we propose the Hybrid Interactional Coherence (HIC) algorithm for identification of web forum interaction. HIC utilizes a bevy of system and linguistic features, including message header information, quotations, direct address, and lexical relations. Furthermore, several similarity-based methods including a Lexical Match Algorithm (LMA) and a sliding window method are utilized to account for interactional idiosyncrasies. Experiments results on two web forums revealed that the proposed HIC algorithm significantly outperformed comparison techniques in terms of precision, recall, and F-measure at both the forum and thread levels. Additionally, an example was used to illustrate how the improved ICA results can facilitate enhanced social network and role analysis capabilities.
Chen, H.; Lally, A.M.; Zhu, B.; Chau, M.: HelpfulMed : Intelligent searching for medical information over the Internet (2003) 0.01
```
0.0066401875 = product of:
  0.013280375 = sum of:
    0.013280375 = product of:
      0.02656075 = sum of:
        0.02656075 = weight(_text_:online in 1615) [ClassicSimilarity], result of:
          0.02656075 = score(doc=1615,freq=2.0), product of:
            0.15842392 = queryWeight, product of:
              3.0349014 = idf(docFreq=5778, maxDocs=44218)
              0.05220068 = queryNorm
            0.16765618 = fieldWeight in 1615, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.0349014 = idf(docFreq=5778, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1615)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
```
Abstract

The Medical professionals and researchers need information from reputable sources to accomplish their work. Unfortunately, the Web has a large number of documents that are irrelevant to their work, even those documents that purport to be "medically-related." This paper describes an architecture designed to integrate advanced searching and indexing algorithms, an automatic thesaurus, or "concept space," and Kohonen-based Self-Organizing Map (SOM) technologies to provide searchers with finegrained results. Initial results indicate that these systems provide complementary retrieval functionalities. HelpfulMed not only allows users to search Web pages and other online databases, but also allows them to build searches through the use of an automatic thesaurus and browse a graphical display of medical-related topics. Evaluation results for each of the different components are included. Our spidering algorithm outperformed both breadth-first search and PageRank spiders an a test collection of 100,000 Web pages. The automatically generated thesaurus performed as well as both MeSH and UMLS-systems which require human mediation for currency. Lastly, a variant of the Kohonen SOM was comparable to MeSH terms in perceived cluster precision and significantly better at perceived cluster recall.
Chau, M.; Shiu, B.; Chan, M.; Chen, H.: Redips: backlink search and analysis on the Web for business intelligence analysis (2007) 0.01
```
0.0066401875 = product of:
  0.013280375 = sum of:
    0.013280375 = product of:
      0.02656075 = sum of:
        0.02656075 = weight(_text_:online in 142) [ClassicSimilarity], result of:
          0.02656075 = score(doc=142,freq=2.0), product of:
            0.15842392 = queryWeight, product of:
              3.0349014 = idf(docFreq=5778, maxDocs=44218)
              0.05220068 = queryNorm
            0.16765618 = fieldWeight in 142, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.0349014 = idf(docFreq=5778, maxDocs=44218)
              0.0390625 = fieldNorm(doc=142)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
```
Abstract

The World Wide Web presents significant opportunities for business intelligence analysis as it can provide information about a company's external environment and its stakeholders. Traditional business intelligence analysis on the Web has focused on simple keyword searching. Recently, it has been suggested that the incoming links, or backlinks, of a company's Web site (i.e., other Web pages that have a hyperlink pointing to the company of Interest) can provide important insights about the company's "online communities." Although analysis of these communities can provide useful signals for a company and information about its stakeholder groups, the manual analysis process can be very time-consuming for business analysts and consultants. In this article, we present a tool called Redips that automatically integrates backlink meta-searching and text-mining techniques to facilitate users in performing such business intelligence analysis on the Web. The architectural design and implementation of the tool are presented in the article. To evaluate the effectiveness, efficiency, and user satisfaction of Redips, an experiment was conducted to compare the tool with two popular business Intelligence analysis methods-using backlink search engines and manual browsing. The experiment results showed that Redips was statistically more effective than both benchmark methods (in terms of Recall and F-measure) but required more time in search tasks. In terms of user satisfaction, Redips scored statistically higher than backlink search engines in all five measures used, and also statistically higher than manual browsing in three measures.
Fu, T.; Abbasi, A.; Chen, H.: ¬A focused crawler for Dark Web forums (2010) 0.01
```
0.0066401875 = product of:
  0.013280375 = sum of:
    0.013280375 = product of:
      0.02656075 = sum of:
        0.02656075 = weight(_text_:online in 3471) [ClassicSimilarity], result of:
          0.02656075 = score(doc=3471,freq=2.0), product of:
            0.15842392 = queryWeight, product of:
              3.0349014 = idf(docFreq=5778, maxDocs=44218)
              0.05220068 = queryNorm
            0.16765618 = fieldWeight in 3471, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.0349014 = idf(docFreq=5778, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3471)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
```
Abstract

The unprecedented growth of the Internet has given rise to the Dark Web, the problematic facet of the Web associated with cybercrime, hate, and extremism. Despite the need for tools to collect and analyze Dark Web forums, the covert nature of this part of the Internet makes traditional Web crawling techniques insufficient for capturing such content. In this study, we propose a novel crawling system designed to collect Dark Web forum content. The system uses a human-assisted accessibility approach to gain access to Dark Web forums. Several URL ordering features and techniques enable efficient extraction of forum postings. The system also includes an incremental crawler coupled with a recall-improvement mechanism intended to facilitate enhanced retrieval and updating of collected content. Experiments conducted to evaluate the effectiveness of the human-assisted accessibility approach and the recall-improvement-based, incremental-update procedure yielded favorable results. The human-assisted approach significantly improved access to Dark Web forums while the incremental crawler with recall improvement also outperformed standard periodic- and incremental-update approaches. Using the system, we were able to collect over 100 Dark Web forums from three regions. A case study encompassing link and content analysis of collected forums was used to illustrate the value and importance of gathering and analyzing content from such online communities.
Yang, M.; Kiang, M.; Chen, H.; Li, Y.: Artificial immune system for illicit content identification in social media (2012) 0.01
```
0.0066401875 = product of:
  0.013280375 = sum of:
    0.013280375 = product of:
      0.02656075 = sum of:
        0.02656075 = weight(_text_:online in 4980) [ClassicSimilarity], result of:
          0.02656075 = score(doc=4980,freq=2.0), product of:
            0.15842392 = queryWeight, product of:
              3.0349014 = idf(docFreq=5778, maxDocs=44218)
              0.05220068 = queryNorm
            0.16765618 = fieldWeight in 4980, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.0349014 = idf(docFreq=5778, maxDocs=44218)
              0.0390625 = fieldNorm(doc=4980)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
```
Abstract

Social media is frequently used as a platform for the exchange of information and opinions as well as propaganda dissemination. But online content can be misused for the distribution of illicit information, such as violent postings in web forums. Illicit content is highly distributed in social media, while non-illicit content is unspecific and topically diverse. It is costly and time consuming to label a large amount of illicit content (positive examples) and non-illicit content (negative examples) to train classification systems. Nevertheless, it is relatively easy to obtain large volumes of unlabeled content in social media. In this article, an artificial immune system-based technique is presented to address the difficulties in the illicit content identification in social media. Inspired by the positive selection principle in the immune system, we designed a novel labeling heuristic based on partially supervised learning to extract high-quality positive and negative examples from unlabeled datasets. The empirical evaluation results from two large hate group web forums suggest that our proposed approach generally outperforms the benchmark techniques and exhibits more stable performance.

Search (17 results, page 1 of 1)

Authors

Years

Themes