Search (17 results, page 1 of 1)

0.057275757 = product of:
  0.085913636 = sum of:
    0.068818994 = weight(_text_:interest in 5259) [ClassicSimilarity], result of:
      0.068818994 = score(doc=5259,freq=2.0), product of:
        0.25074318 = queryWeight, product of:
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.05046903 = queryNorm
        0.27446008 = fieldWeight in 5259, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5259)
    0.017094642 = product of:
      0.034189284 = sum of:
        0.034189284 = weight(_text_:22 in 5259) [ClassicSimilarity], result of:
          0.034189284 = score(doc=5259,freq=2.0), product of:
            0.17673394 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05046903 = 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.6666667 = coord(2/3)

Abstract

The increasing amount of publicly available literature and experimental data in biomedicine makes it hard for biomedical researchers to stay up-to-date. Genescene is a toolkit that will help alleviate this problem by providing an overview of published literature content. We combined a linguistic parser with Concept Space, a co-occurrence based semantic net. Both techniques extract complementary biomedical relations between noun phrases from MEDLINE abstracts. The parser extracts precise and semantically rich relations from individual abstracts. Concept Space extracts relations that hold true for the collection of abstracts. The Gene Ontology, the Human Genome Nomenclature, and the Unified Medical Language System, are also integrated in Genescene. Currently, they are used to facilitate the integration of the two relation types, and to select the more interesting and high-quality relations for presentation. A user study focusing on p53 literature is discussed. All MEDLINE abstracts discussing p53 were processed in Genescene. Two researchers evaluated the terms and relations from several abstracts of interest to them. The results show that the terms were precise (precision 93%) and relevant, as were the parser relations (precision 95%). The Concept Space relations were more precise when selected with ontological knowledge (precision 78%) than without (60%).

Date

22. 7.2006 14:26:01

0.030248001 = product of:
  0.090744 = sum of:
    0.090744 = sum of:
      0.056554716 = weight(_text_:classification in 5276) [ClassicSimilarity], result of:
        0.056554716 = score(doc=5276,freq=8.0), product of:
          0.16072905 = queryWeight, product of:
            3.1847067 = idf(docFreq=4974, maxDocs=44218)
            0.05046903 = queryNorm
          0.35186368 = fieldWeight in 5276, product of:
            2.828427 = tf(freq=8.0), with freq of:
              8.0 = termFreq=8.0
            3.1847067 = idf(docFreq=4974, maxDocs=44218)
            0.0390625 = fieldNorm(doc=5276)
      0.034189284 = weight(_text_:22 in 5276) [ClassicSimilarity], result of:
        0.034189284 = score(doc=5276,freq=2.0), product of:
          0.17673394 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05046903 = 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.33333334 = coord(1/3)

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

0.022939665 = product of:
  0.068818994 = sum of:
    0.068818994 = weight(_text_:interest in 142) [ClassicSimilarity], result of:
      0.068818994 = score(doc=142,freq=2.0), product of:
        0.25074318 = queryWeight, product of:
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.05046903 = queryNorm
        0.27446008 = fieldWeight in 142, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.0390625 = fieldNorm(doc=142)
  0.33333334 = coord(1/3)

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.

0.018351734 = product of:
  0.055055197 = sum of:
    0.055055197 = weight(_text_:interest in 869) [ClassicSimilarity], result of:
      0.055055197 = score(doc=869,freq=2.0), product of:
        0.25074318 = queryWeight, product of:
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.05046903 = queryNorm
        0.21956807 = fieldWeight in 869, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.03125 = fieldNorm(doc=869)
  0.33333334 = coord(1/3)

Abstract

The Internet provides an exceptional testbed for developing algorithms that can improve bowsing and searching large information spaces. Browsing and searching tasks are susceptible to problems of information overload and vocabulary differences. Much of the current research is aimed at the development and refinement of algorithms to improve browsing and searching by addressing these problems. Our research was focused on discovering whether two of the algorithms our research group has developed, a Kohonen algorithm category map for browsing, and an automatically generated concept space algorithm for searching, can help improve browsing and / or searching the Internet. Our results indicate that a Kohonen self-organizing map (SOM)-based algorithm can successfully categorize a large and eclectic Internet information space (the Entertainment subcategory of Yahoo!) into manageable sub-spaces that users can successfully navigate to locate a homepage of interest to them. The SOM algorithm worked best with browsing tasks that were very broad, and in which subjects skipped around between categories. Subjects especially liked the visual and graphical aspects of the map. Subjects who tried to do a directed search, and those that wanted to use the more familiar mental models (alphabetic or hierarchical organization) for browsing, found that the work did not work well. The results from the concept space experiment were especially encouraging. There were no significant differences among the precision measures for the set of documents identified by subject-suggested terms, thesaurus-suggested terms, and the combination of subject- and thesaurus-suggested terms. The recall measures indicated that the combination of subject- and thesaurs-suggested terms exhibited significantly better recall than subject-suggested terms alone. Furthermore, analysis of the homepages indicated that there was limited overlap between the homepages retrieved by the subject-suggested and thesaurus-suggested terms. Since the retrieval homepages for the most part were different, this suggests that a user can enhance a keyword-based search by using an automatically generated concept space. Subejcts especially liked the level of control that they could exert over the search, and the fact that the terms suggested by the thesaurus were 'real' (i.e., orininating in the homepages) and therefore guaranteed to have retrieval success

0.016057767 = product of:
  0.0481733 = sum of:
    0.0481733 = weight(_text_:interest in 4276) [ClassicSimilarity], result of:
      0.0481733 = score(doc=4276,freq=2.0), product of:
        0.25074318 = queryWeight, product of:
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.05046903 = queryNorm
        0.19212207 = fieldWeight in 4276, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.02734375 = fieldNorm(doc=4276)
  0.33333334 = coord(1/3)

Abstract

Advanced technology has resulted in the generation of about one million terabytes of information every year. Ninety-reine percent of this is available in digital format (Keim, 2001). More information will be generated in the next three years than was created during all of previous human history (Keim, 2001). Collecting information is no longer a problem, but extracting value from information collections has become progressively more difficult. Various search engines have been developed to make it easier to locate information of interest, but these work well only for a person who has a specific goal and who understands what and how information is stored. This usually is not the Gase. Visualization was commonly thought of in terms of representing human mental processes (MacEachren, 1991; Miller, 1984). The concept is now associated with the amplification of these mental processes (Card, Mackinlay, & Shneiderman, 1999). Human eyes can process visual cues rapidly, whereas advanced information analysis techniques transform the computer into a powerful means of managing digitized information. Visualization offers a link between these two potent systems, the human eye and the computer (Gershon, Eick, & Card, 1998), helping to identify patterns and to extract insights from large amounts of information. The identification of patterns is important because it may lead to a scientific discovery, an interpretation of clues to solve a crime, the prediction of catastrophic weather, a successful financial investment, or a better understanding of human behavior in a computermediated environment. Visualization technology shows considerable promise for increasing the value of large-scale collections of information, as evidenced by several commercial applications of TreeMap (e.g., http://www.smartmoney.com) and Hyperbolic tree (e.g., http://www.inxight.com) to visualize large-scale hierarchical structures. Although the proliferation of visualization technologies dates from the 1990s where sophisticated hardware and software made increasingly faster generation of graphical objects possible, the role of visual aids in facilitating the construction of mental images has a long history. Visualization has been used to communicate ideas, to monitor trends implicit in data, and to explore large volumes of data for hypothesis generation. Imagine traveling to a strange place without a map, having to memorize physical and chemical properties of an element without Mendeleyev's periodic table, trying to understand the stock market without statistical diagrams, or browsing a collection of documents without interactive visual aids. A collection of information can lose its value simply because of the effort required for exhaustive exploration. Such frustrations can be overcome by visualization.

0.014753691 = product of:
  0.04426107 = sum of:
    0.04426107 = product of:
      0.08852214 = sum of:
        0.08852214 = weight(_text_:classification in 6928) [ClassicSimilarity], result of:
          0.08852214 = score(doc=6928,freq=10.0), product of:
            0.16072905 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05046903 = queryNorm
            0.55075383 = fieldWeight in 6928, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0546875 = fieldNorm(doc=6928)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

Describes research in the application of a Kohonen Self-Organizing Map (SOM) to the problem of classification of electronic brainstorming output and an evaluation of the results. Describes an electronic meeting system and describes the classification problem that exists in the group problem solving process. Surveys the literature concerning classification. Describes the application of the Kohonen SOM to the meeting output classification problem. Describes an experiment that evaluated the classification performed by the Kohonen SOM by comparing it with those of a human expert and a Hopfield neural network. Discusses conclusions and directions for future research

0.013330075 = product of:
  0.039990224 = sum of:
    0.039990224 = product of:
      0.07998045 = sum of:
        0.07998045 = weight(_text_:classification in 237) [ClassicSimilarity], result of:
          0.07998045 = score(doc=237,freq=16.0), product of:
            0.16072905 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05046903 = queryNorm
            0.49761042 = fieldWeight in 237, product of:
              4.0 = tf(freq=16.0), with freq of:
                16.0 = termFreq=16.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0390625 = fieldNorm(doc=237)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

We study the problem of question topic classification using a very large real-world Community Question Answering (CQA) dataset from Yahoo! Answers. The dataset comprises 3.9 million questions and these questions are organized into more than 1,000 categories in a hierarchy. To the best knowledge, this is the first systematic evaluation of the performance of different classification methods on question topic classification as well as short texts. Specifically, we empirically evaluate the following in classifying questions into CQA categories: (a) the usefulness of n-gram features and bag-of-word features; (b) the performance of three standard classification algorithms (naive Bayes, maximum entropy, and support vector machines); (c) the performance of the state-of-the-art hierarchical classification algorithms; (d) the effect of training data size on performance; and (e) the effectiveness of the different components of CQA data, including subject, content, asker, and the best answer. The experimental results show what aspects are important for question topic classification in terms of both effectiveness and efficiency. We believe that the experimental findings from this study will be useful in real-world classification problems.

0.011310944 = product of:
  0.03393283 = sum of:
    0.03393283 = product of:
      0.06786566 = sum of:
        0.06786566 = weight(_text_:classification in 492) [ClassicSimilarity], result of:
          0.06786566 = score(doc=492,freq=2.0), product of:
            0.16072905 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05046903 = queryNorm
            0.42223644 = fieldWeight in 492, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.09375 = fieldNorm(doc=492)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

0.009425786 = product of:
  0.028277358 = sum of:
    0.028277358 = product of:
      0.056554716 = sum of:
        0.056554716 = weight(_text_:classification in 3452) [ClassicSimilarity], result of:
          0.056554716 = score(doc=3452,freq=8.0), product of:
            0.16072905 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05046903 = queryNorm
            0.35186368 = fieldWeight in 3452, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3452)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

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.

0.0075406292 = product of:
  0.022621887 = sum of:
    0.022621887 = product of:
      0.045243774 = sum of:
        0.045243774 = weight(_text_:classification in 8221) [ClassicSimilarity], result of:
          0.045243774 = score(doc=8221,freq=2.0), product of:
            0.16072905 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05046903 = queryNorm
            0.28149095 = fieldWeight in 8221, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0625 = fieldNorm(doc=8221)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

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

0.006837857 = product of:
  0.02051357 = sum of:
    0.02051357 = product of:
      0.04102714 = sum of:
        0.04102714 = weight(_text_:22 in 2733) [ClassicSimilarity], result of:
          0.04102714 = score(doc=2733,freq=2.0), product of:
            0.17673394 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05046903 = 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.33333334 = coord(1/3)

Date

22. 3.2009 17:57:50

0.0056982143 = product of:
  0.017094642 = sum of:
    0.017094642 = product of:
      0.034189284 = sum of:
        0.034189284 = weight(_text_:22 in 7469) [ClassicSimilarity], result of:
          0.034189284 = score(doc=7469,freq=2.0), product of:
            0.17673394 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05046903 = 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.33333334 = coord(1/3)

Source

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

0.0056982143 = product of:
  0.017094642 = sum of:
    0.017094642 = product of:
      0.034189284 = sum of:
        0.034189284 = weight(_text_:22 in 2753) [ClassicSimilarity], result of:
          0.034189284 = score(doc=2753,freq=2.0), product of:
            0.17673394 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05046903 = 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.33333334 = coord(1/3)

Date

22. 3.2009 18:50:30

0.005655472 = product of:
  0.016966416 = sum of:
    0.016966416 = product of:
      0.03393283 = sum of:
        0.03393283 = weight(_text_:classification in 1611) [ClassicSimilarity], result of:
          0.03393283 = score(doc=1611,freq=2.0), product of:
            0.16072905 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05046903 = queryNorm
            0.21111822 = fieldWeight in 1611, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.046875 = fieldNorm(doc=1611)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

Relation extraction is the process of scanning text for relationships between named entities. Recently, significant studies have focused on automatically extracting relations from biomedical corpora. Most existing biomedical relation extractors require manual creation of biomedical lexicons or parsing templates based on domain knowledge. In this study, we propose to use kernel-based learning methods to automatically extract biomedical relations from literature text. We develop a framework of kernel-based learning for biomedical relation extraction. In particular, we modified the standard tree kernel function by incorporating a trace kernel to capture richer contextual information. In our experiments on a biomedical corpus, we compare different kernel functions for biomedical relation detection and classification. The experimental results show that a tree kernel outperforms word and sequence kernels for relation detection, our trace-tree kernel outperforms the standard tree kernel, and a composite kernel outperforms individual kernels for relation extraction.

0.005655472 = product of:
  0.016966416 = sum of:
    0.016966416 = product of:
      0.03393283 = sum of:
        0.03393283 = weight(_text_:classification in 1262) [ClassicSimilarity], result of:
          0.03393283 = score(doc=1262,freq=2.0), product of:
            0.16072905 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05046903 = queryNorm
            0.21111822 = fieldWeight in 1262, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.046875 = fieldNorm(doc=1262)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

Understanding specific patterns or knowledge of self-disclosing health information could support public health surveillance and healthcare. This study aimed to develop an analytical framework to identify self-disclosing health information with unusual messages on web forums by leveraging advanced text-mining techniques. To demonstrate the performance of the proposed analytical framework, we conducted an experimental study on 2 major human immunodeficiency virus (HIV)/acquired immune deficiency syndrome (AIDS) forums in Taiwan. The experimental results show that the classification accuracy increased significantly (up to 83.83%) when using features selected by the information gain technique. The results also show the importance of adopting domain-specific features in analyzing unusual messages on web forums. This study has practical implications for the prevention and support of HIV/AIDS healthcare. For example, public health agencies can re-allocate resources and deliver services to people who need help via social media sites. In addition, individuals can also join a social media site to get better suggestions and support from each other.

0.004712893 = product of:
  0.014138679 = sum of:
    0.014138679 = product of:
      0.028277358 = sum of:
        0.028277358 = weight(_text_:classification in 2699) [ClassicSimilarity], result of:
          0.028277358 = score(doc=2699,freq=2.0), product of:
            0.16072905 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05046903 = queryNorm
            0.17593184 = fieldWeight in 2699, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2699)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

As the Web is used increasingly to share and disseminate information, business analysts and managers are challenged to understand stakeholder relationships. Traditional stakeholder theories and frameworks employ a manual approach to analysis and do not scale up to accommodate the rapid growth of the Web. Unfortunately, existing business intelligence (BI) tools lack analysis capability, and research on BI systems is sparse. This research proposes a framework for designing BI systems to identify and to classify stakeholders on the Web, incorporating human knowledge and machine-learned information from Web pages. Based on the framework, we have developed a prototype called Business Stakeholder Analyzer (BSA) that helps managers and analysts to identify and to classify their stakeholders on the Web. Results from our experiment involving algorithm comparison, feature comparison, and a user study showed that the system achieved better within-class accuracies in widespread stakeholder types such as partner/sponsor/supplier and media/reviewer, and was more efficient than human classification. The student and practitioner subjects in our user study strongly agreed that such a system would save analysts' time and help to identify and classify stakeholders. This research contributes to a better understanding of how to integrate information technology with stakeholder theory, and enriches the knowledge base of BI system design.

0.004712893 = product of:
  0.014138679 = sum of:
    0.014138679 = product of:
      0.028277358 = sum of:
        0.028277358 = weight(_text_:classification in 4980) [ClassicSimilarity], result of:
          0.028277358 = score(doc=4980,freq=2.0), product of:
            0.16072905 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05046903 = queryNorm
            0.17593184 = fieldWeight in 4980, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0390625 = fieldNorm(doc=4980)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

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.