Search (39 results, page 1 of 2)

  • × author_ss:"Chen, H."
  1. Chen, H.: Machine learning for information retrieval : neural networks, symbolic learning, and genetic algorithms (1994) 0.04 
    0.04488246 = product of:
  0.15708861 = sum of:
    0.06131703 = weight(_text_:based in 2657) [ClassicSimilarity], result of:
      0.06131703 = score(doc=2657,freq=10.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.5210583 = fieldWeight in 2657, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2657)
    0.09577157 = weight(_text_:great in 2657) [ClassicSimilarity], result of:
      0.09577157 = score(doc=2657,freq=2.0), product of:
        0.21992016 = queryWeight, product of:
          5.6307793 = idf(docFreq=430, maxDocs=44218)
          0.03905679 = queryNorm
        0.43548337 = fieldWeight in 2657, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.6307793 = idf(docFreq=430, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2657)
  0.2857143 = coord(2/7)
    Abstract
    In the 1980s, knowledge-based techniques also made an impressive contribution to 'intelligent' information retrieval and indexing. More recently, researchers have turned to newer artificial intelligence based inductive learning techniques including neural networks, symbolic learning, and genetic algorithms grounded on diverse paradigms. These have provided great opportunities to enhance the capabilities of current information storage and retrieval systems. Provides an overview of these techniques and presents 3 popular methods: the connectionist Hopfield network; the symbolic ID3/ID5R; and evaluation based genetic algorithms in the context of information retrieval. The techniques are promising in their ability to analyze user queries, identify users' information needs, and suggest alternatives for search and can greatly complement the prevailing full text, keyword based, probabilistic, and knowledge based techniques
  2. Schroeder, J.; Xu, J.; Chen, H.; Chau, M.: Automated criminal link analysis based on domain knowledge (2007) 0.04 
    0.03688536 = product of:
  0.12909874 = sum of:
    0.047008816 = weight(_text_:based in 275) [ClassicSimilarity], result of:
      0.047008816 = score(doc=275,freq=8.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.39947033 = fieldWeight in 275, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.046875 = fieldNorm(doc=275)
    0.08208992 = weight(_text_:great in 275) [ClassicSimilarity], result of:
      0.08208992 = score(doc=275,freq=2.0), product of:
        0.21992016 = queryWeight, product of:
          5.6307793 = idf(docFreq=430, maxDocs=44218)
          0.03905679 = queryNorm
        0.37327147 = fieldWeight in 275, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.6307793 = idf(docFreq=430, maxDocs=44218)
          0.046875 = fieldNorm(doc=275)
  0.2857143 = coord(2/7)
    Abstract
    Link (association) analysis has been used in the criminal justice domain to search large datasets for associations between crime entities in order to facilitate crime investigations. However, link analysis still faces many challenging problems, such as information overload, high search complexity, and heavy reliance on domain knowledge. To address these challenges, this article proposes several techniques for automated, effective, and efficient link analysis. These techniques include the co-occurrence analysis, the shortest path algorithm, and a heuristic approach to identifying associations and determining their importance. We developed a prototype system called CrimeLink Explorer based on the proposed techniques. Results of a user study with 10 crime investigators from the Tucson Police Department showed that our system could help subjects conduct link analysis more efficiently than traditional single-level link analysis tools. Moreover, subjects believed that association paths found based on the heuristic approach were more accurate than those found based solely on the co-occurrence analysis and that the automated link analysis system would be of great help in crime investigations.
  3. Chen, H.; Shankaranarayanan, G.; She, L.: ¬A machine learning approach to inductive query by examples : an experiment using relevance feedback, ID3, genetic algorithms, and simulated annealing (1998) 0.03 
    0.03295148 = product of:
  0.115330175 = sum of:
    0.03324025 = weight(_text_:based in 1148) [ClassicSimilarity], result of:
      0.03324025 = score(doc=1148,freq=4.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.28246817 = fieldWeight in 1148, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.046875 = fieldNorm(doc=1148)
    0.08208992 = weight(_text_:great in 1148) [ClassicSimilarity], result of:
      0.08208992 = score(doc=1148,freq=2.0), product of:
        0.21992016 = queryWeight, product of:
          5.6307793 = idf(docFreq=430, maxDocs=44218)
          0.03905679 = queryNorm
        0.37327147 = fieldWeight in 1148, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.6307793 = idf(docFreq=430, maxDocs=44218)
          0.046875 = fieldNorm(doc=1148)
  0.2857143 = coord(2/7)
    Abstract
    Information retrieval using probabilistic techniques has attracted significant attention on the part of researchers in information and computer science over the past few decades. In the 1980s, knowledge-based techniques also made an impressive contribution to 'intelligent' information retrieval and indexing. More recently, information science researchers have tfurned to other newer inductive learning techniques including symbolic learning, genetic algorithms, and simulated annealing. These newer techniques, which are grounded in diverse paradigms, have provided great opportunities for researchers to enhance the information processing and retrieval capabilities of current information systems. In this article, we first provide an overview of these newer techniques and their use in information retrieval research. In order to femiliarize readers with the techniques, we present 3 promising methods: the symbolic ID3 algorithm, evolution-based genetic algorithms, and simulated annealing. We discuss their knowledge representations and algorithms in the unique context of information retrieval
  4. Huang, Z.; Chung, Z.W.; Chen, H.: ¬A graph model for e-commerce recommender systems (2004) 0.02 
    0.021285411 = product of:
  0.14899787 = sum of:
    0.14899787 = weight(_text_:businesses in 501) [ClassicSimilarity], result of:
      0.14899787 = score(doc=501,freq=2.0), product of:
        0.29628533 = queryWeight, product of:
          7.5860133 = idf(docFreq=60, maxDocs=44218)
          0.03905679 = queryNorm
        0.5028864 = fieldWeight in 501, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.5860133 = idf(docFreq=60, maxDocs=44218)
          0.046875 = fieldNorm(doc=501)
  0.14285715 = coord(1/7)
    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.
  5. Jiang, S.; Gao, Q.; Chen, H.; Roco, M.C.: ¬The roles of sharing, transfer, and public funding in nanotechnology knowledge-diffusion networks (2015) 0.02 
    0.021285411 = product of:
  0.14899787 = sum of:
    0.14899787 = weight(_text_:businesses in 1823) [ClassicSimilarity], result of:
      0.14899787 = score(doc=1823,freq=2.0), product of:
        0.29628533 = queryWeight, product of:
          7.5860133 = idf(docFreq=60, maxDocs=44218)
          0.03905679 = queryNorm
        0.5028864 = fieldWeight in 1823, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.5860133 = idf(docFreq=60, maxDocs=44218)
          0.046875 = fieldNorm(doc=1823)
  0.14285715 = coord(1/7)
    Abstract
    Understanding the knowledge-diffusion networks of patent inventors can help governments and businesses effectively use their investment to stimulate commercial science and technology development. Such inventor networks are usually large and complex. This study proposes a multidimensional network analysis framework that utilizes Exponential Random Graph Models (ERGMs) to simultaneously model knowledge-sharing and knowledge-transfer processes, examine their interactions, and evaluate the impacts of network structures and public funding on knowledge-diffusion networks. Experiments are conducted on a longitudinal data set that covers 2 decades (1991-2010) of nanotechnology-related US Patent and Trademark Office (USPTO) patents. The results show that knowledge sharing and knowledge transfer are closely interrelated. High degree centrality or boundary inventors play significant roles in the network, and National Science Foundation (NSF) public funding positively affects knowledge sharing despite its small fraction in overall funding and upstream research topics.
  6. Marshall, B.; McDonald, D.; Chen, H.; Chung, W.: EBizPort: collecting and analyzing business intelligence information (2004) 0.02 
    0.017737841 = product of:
  0.12416488 = sum of:
    0.12416488 = weight(_text_:businesses in 2505) [ClassicSimilarity], result of:
      0.12416488 = score(doc=2505,freq=2.0), product of:
        0.29628533 = queryWeight, product of:
          7.5860133 = idf(docFreq=60, maxDocs=44218)
          0.03905679 = queryNorm
        0.41907197 = fieldWeight in 2505, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.5860133 = idf(docFreq=60, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2505)
  0.14285715 = coord(1/7)
    Abstract
    To make good decisions, businesses try to gather good intelligence information. Yet managing and processing a large amount of unstructured information and data stand in the way of greater business knowledge. An effective business intelligence tool must be able to access quality information from a variety of sources in a variety of forms, and it must support people as they search for and analyze that information. The EBizPort system was designed to address information needs for the business/IT community. EBizPort's collection-building process is designed to acquire credible, timely, and relevant information. The user interface provides access to collected and metasearched resources using innovative tools for summarization, categorization, and visualization. The effectiveness, efficiency, usability, and information quality of the EBizPort system were measured. EBizPort significantly outperformed Brint, a business search portal, in search effectiveness, information quality, user satisfaction, and usability. Users particularly liked EBizPort's clean and user-friendly interface. Results from our evaluation study suggest that the visualization function added value to the search and analysis process, that the generalizable collection-building technique can be useful for domain-specific information searching an the Web, and that the search interface was important for Web search and browse support.
  7. Leroy, G.; Chen, H.: Genescene: an ontology-enhanced integration of linguistic and co-occurrence based relations in biomedical texts (2005) 0.01 
    0.0116941 = product of:
  0.040929347 = sum of:
    0.02770021 = weight(_text_:based in 5259) [ClassicSimilarity], result of:
      0.02770021 = score(doc=5259,freq=4.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.23539014 = fieldWeight in 5259, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5259)
    0.013229139 = product of:
      0.026458278 = sum of:
        0.026458278 = weight(_text_:22 in 5259) [ClassicSimilarity], result of:
          0.026458278 = score(doc=5259,freq=2.0), product of:
            0.13677022 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03905679 = 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.2857143 = coord(2/7)
    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
  8. Carmel, E.; Crawford, S.; Chen, H.: Browsing in hypertext : a cognitive study (1992) 0.01 
    0.009376042 = product of:
  0.032816146 = sum of:
    0.019587006 = weight(_text_:based in 7469) [ClassicSimilarity], result of:
      0.019587006 = score(doc=7469,freq=2.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.16644597 = fieldWeight in 7469, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.0390625 = fieldNorm(doc=7469)
    0.013229139 = product of:
      0.026458278 = sum of:
        0.026458278 = weight(_text_:22 in 7469) [ClassicSimilarity], result of:
          0.026458278 = score(doc=7469,freq=2.0), product of:
            0.13677022 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03905679 = 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.2857143 = coord(2/7)
    Abstract
    With the growth of hypertext and multimedia applications that support and encourage browsing it is time to take a penetrating look at browsing behaviour. Several dimensions of browsing are exemined, to find out: first, what is browsing and what cognitive processes are associated with it: second, is there a browsing strategy, and if so, are there any differences between how subject-area experts and novices browse; and finally, how can this knowledge be applied to improve the design of hypertext systems. Two groups of students, subject-area experts and novices, were studied while browsing a Macintosh HyperCard application on the subject The Vietnam War. A protocol analysis technique was used to gather and analyze data. Components of the GOMS model were used to describe the goals, operators, methods, and selection rules observed: Three browsing strategies were identified: (1) search-oriented browse, scanning and and reviewing information relevant to a fixed task; (2) review-browse, scanning and reviewing intersting information in the presence of transient browse goals that represent changing tasks, and (3) scan-browse, scanning for interesting information (without review). Most subjects primarily used review-browse interspersed with search-oriented browse. Within this strategy, comparisons between subject-area experts and novices revealed differences in tactics: experts browsed in more depth, seldom used referential links, selected different kinds of topics, and viewed information differently thatn did novices. Based on these findings, suggestions are made to hypertext developers
    Source
    IEEE transactions on systems, man and cybernetics. 22(1992) no.5, S.865-884
  9. Zheng, R.; Li, J.; Chen, H.; Huang, Z.: ¬A framework for authorship identification of online messages : writing-style features and classification techniques (2006) 0.01 
    0.009376042 = product of:
  0.032816146 = sum of:
    0.019587006 = weight(_text_:based in 5276) [ClassicSimilarity], result of:
      0.019587006 = score(doc=5276,freq=2.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.16644597 = fieldWeight in 5276, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5276)
    0.013229139 = product of:
      0.026458278 = sum of:
        0.026458278 = weight(_text_:22 in 5276) [ClassicSimilarity], result of:
          0.026458278 = score(doc=5276,freq=2.0), product of:
            0.13677022 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03905679 = 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)
  0.2857143 = coord(2/7)
    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
  10. Chen, H.: Knowledge-based document retrieval : framework and design (1992) 0.01 
    0.00895406 = product of:
  0.06267842 = sum of:
    0.06267842 = weight(_text_:based in 5283) [ClassicSimilarity], result of:
      0.06267842 = score(doc=5283,freq=2.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.5326271 = fieldWeight in 5283, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.125 = fieldNorm(doc=5283)
  0.14285715 = coord(1/7)
  11. Chen, H.: Generating, integrating and activating thesauri for concept-based document retrieval (1993) 0.01 
    0.00895406 = product of:
  0.06267842 = sum of:
    0.06267842 = weight(_text_:based in 7623) [ClassicSimilarity], result of:
      0.06267842 = score(doc=7623,freq=2.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.5326271 = fieldWeight in 7623, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.125 = fieldNorm(doc=7623)
  0.14285715 = coord(1/7)
  12. Chen, H.; Lynch, K.J.; Bashu, K.; Ng, T.D.: Generating, integrating, and activating thesauri for concept-based document retrieval (1993) 0.01 
    0.00895406 = product of:
  0.06267842 = sum of:
    0.06267842 = weight(_text_:based in 8549) [ClassicSimilarity], result of:
      0.06267842 = score(doc=8549,freq=2.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.5326271 = fieldWeight in 8549, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.125 = fieldNorm(doc=8549)
  0.14285715 = coord(1/7)
  13. Chen, H.: Intelligence and security informatics : Introduction to the special topic issue (2005) 0.01 
    0.006840827 = product of:
  0.047885787 = sum of:
    0.047885787 = weight(_text_:great in 3232) [ClassicSimilarity], result of:
      0.047885787 = score(doc=3232,freq=2.0), product of:
        0.21992016 = queryWeight, product of:
          5.6307793 = idf(docFreq=430, maxDocs=44218)
          0.03905679 = queryNorm
        0.21774168 = fieldWeight in 3232, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.6307793 = idf(docFreq=430, maxDocs=44218)
          0.02734375 = fieldNorm(doc=3232)
  0.14285715 = coord(1/7)
    Abstract
    Making the Nation Safer: The Role of Science and Technology in Countering Terrorism The commitment of the scientific, engineering, and health communities to helping the United States and the world respond to security challenges became evident after September 11, 2001. The U.S. National Research Council's report an "Making the Nation Safer: The Role of Science and Technology in Countering Terrorism," (National Research Council, 2002, p. 1) explains the context of such a new commitment: Terrorism is a serious threat to the Security of the United States and indeed the world. The vulnerability of societies to terrorist attacks results in part from the proliferation of chemical, biological, and nuclear weapons of mass destruction, but it also is a consequence of the highly efficient and interconnected systems that we rely an for key services such as transportation, information, energy, and health care. The efficient functioning of these systems reflects great technological achievements of the past century, but interconnectedness within and across systems also means that infrastructures are vulnerable to local disruptions, which could lead to widespread or catastrophic failures. As terrorists seek to exploit these vulnerabilities, it is fitting that we harness the nation's exceptional scientific and technological capabilities to Counter terrorist threats. A committee of 24 of the leading scientific, engineering, medical, and policy experts in the United States conducted the study described in the report. Eight panels were separately appointed and asked to provide input to the committee. The panels included: (a) biological sciences, (b) chemical issues, (c) nuclear and radiological issues, (d) information technology, (e) transportation, (f) energy facilities, Cities, and fixed infrastructure, (g) behavioral, social, and institutional issues, and (h) systems analysis and systems engineering. The focus of the committee's work was to make the nation safer from emerging terrorist threats that sought to inflict catastrophic damage an the nation's people, its infrastructure, or its economy. The committee considered nine areas, each of which is discussed in a separate chapter in the report: nuclear and radiological materials, human and agricultural health systems, toxic chemicals and explosive materials, information technology, energy systems, transportation systems, Cities and fixed infrastructure, the response of people to terrorism, and complex and interdependent systems. The chapter an information technology (IT) is particularly relevant to this special issue. The report recommends that "a strategic long-term research and development agenda should be established to address three primary counterterrorismrelated areas in IT: information and network security, the IT needs of emergency responders, and information fusion and management" (National Research Council, 2002, pp. 11 -12). The MD in information and network security should include approaches and architectures for prevention, identification, and containment of cyber-intrusions and recovery from them. The R&D to address IT needs of emergency responders should include ensuring interoperability, maintaining and expanding communications capability during an emergency, communicating with the public during an emergency, and providing support for decision makers. The R&D in information fusion and management for the intelligence, law enforcement, and emergency response communities should include data mining, data integration, language technologies, and processing of image and audio data. Much of the research reported in this special issue is related to information fusion and management for homeland security.
  14. Chen, H.; Ng, T.: ¬An algorithmic approach to concept exploration in a large knowledge network (automatic thesaurus consultation) : symbolic branch-and-bound search versus connectionist Hopfield Net Activation (1995) 0.01 
    0.0067155454 = product of:
  0.047008816 = sum of:
    0.047008816 = weight(_text_:based in 2203) [ClassicSimilarity], result of:
      0.047008816 = score(doc=2203,freq=8.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.39947033 = fieldWeight in 2203, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.046875 = fieldNorm(doc=2203)
  0.14285715 = coord(1/7)
    Abstract
    Presents a framework for knowledge discovery and concept exploration. In order to enhance the concept exploration capability of knowledge based systems and to alleviate the limitation of the manual browsing approach, develops 2 spreading activation based algorithms for concept exploration in large, heterogeneous networks of concepts (eg multiple thesauri). One algorithm, which is based on the symbolic AI paradigma, performs a conventional branch-and-bound search on a semantic net representation to identify other highly relevant concepts (a serial, optimal search process). The 2nd algorithm, which is absed on the neural network approach, executes the Hopfield net parallel relaxation and convergence process to identify 'convergent' concepts for some initial queries (a parallel, heuristic search process). Tests these 2 algorithms on a large text-based knowledge network of about 13.000 nodes (terms) and 80.000 directed links in the area of computing technologies
  15. Li, J.; Zhang, Z.; Li, X.; Chen, H.: Kernel-based learning for biomedical relation extraction (2008) 0.01 
    0.0067155454 = product of:
  0.047008816 = sum of:
    0.047008816 = weight(_text_:based in 1611) [ClassicSimilarity], result of:
      0.047008816 = score(doc=1611,freq=8.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.39947033 = fieldWeight in 1611, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.046875 = fieldNorm(doc=1611)
  0.14285715 = coord(1/7)
    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.
  16. Chen, H.; Dhar, V.: Cognitive process as a basis for intelligent retrieval system design (1991) 0.01 
    0.006331477 = product of:
  0.044320337 = sum of:
    0.044320337 = weight(_text_:based in 3845) [ClassicSimilarity], result of:
      0.044320337 = score(doc=3845,freq=4.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.37662423 = fieldWeight in 3845, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.0625 = fieldNorm(doc=3845)
  0.14285715 = coord(1/7)
    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
  17. Chen, H.: Explaining and alleviating information management indeterminism : a knowledge-based framework (1994) 0.01 
    0.006331477 = product of:
  0.044320337 = sum of:
    0.044320337 = weight(_text_:based in 8221) [ClassicSimilarity], result of:
      0.044320337 = score(doc=8221,freq=4.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.37662423 = fieldWeight in 8221, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.0625 = fieldNorm(doc=8221)
  0.14285715 = coord(1/7)
    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
  18. Chen, H.; Chung, Y.-M.; Ramsey, M.; Yang, C.C.: ¬A smart itsy bitsy spider for the Web (1998) 0.01 
    0.005596288 = product of:
  0.039174013 = sum of:
    0.039174013 = weight(_text_:based in 871) [ClassicSimilarity], result of:
      0.039174013 = score(doc=871,freq=8.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.33289194 = fieldWeight in 871, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.0390625 = fieldNorm(doc=871)
  0.14285715 = coord(1/7)
    Abstract
    As part of the ongoing Illinois Digital Library Initiative project, this research proposes an intelligent agent approach to Web searching. In this experiment, we developed 2 Web personal spiders based on best first search and genetic algorithm techniques, respectively. These personal spiders can dynamically take a user's selected starting homepages and search for the most closely related homepages in the Web, based on the links and keyword indexing. A graphical, dynamic, Jav-based interface was developed and is available for Web access. A system architecture for implementing such an agent-spider is presented, followed by deteiled discussions of benchmark testing and user evaluation results. In benchmark testing, although the genetic algorithm spider did not outperform the best first search spider, we found both results to be comparable and complementary. In user evaluation, the genetic algorithm spider obtained significantly higher recall value than that of the best first search spider. However, their precision values were not statistically different. The mutation process introduced in genetic algorithms allows users to find other potential relevant homepages that cannot be explored via a conventional local search process. In addition, we found the Java-based interface to be a necessary component for design of a truly interactive and dynamic Web agent
  19. Huang, C.; Fu, T.; Chen, H.: Text-based video content classification for online video-sharing sites (2010) 0.01 
    0.005596288 = product of:
  0.039174013 = sum of:
    0.039174013 = weight(_text_:based in 3452) [ClassicSimilarity], result of:
      0.039174013 = score(doc=3452,freq=8.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.33289194 = fieldWeight in 3452, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3452)
  0.14285715 = coord(1/7)
    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.
  20. Marshall, B.; Chen, H.; Kaza, S.: Using importance flooding to identify interesting networks of criminal activity (2008) 0.00 
    0.0048465277 = product of:
  0.033925693 = sum of:
    0.033925693 = weight(_text_:based in 2386) [ClassicSimilarity], result of:
      0.033925693 = score(doc=2386,freq=6.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.28829288 = fieldWeight in 2386, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2386)
  0.14285715 = coord(1/7)
    Abstract
    Effectively harnessing available data to support homeland-security-related applications is a major focus in the emerging science of intelligence and security informatics (ISI). Many studies have focused on criminal-network analysis as a major challenge within the ISI domain. Though various methodologies have been proposed, none have been tested for usefulness in creating link charts. This study compares manually created link charts to suggestions made by the proposed importance-flooding algorithm. Mirroring manual investigational processes, our iterative computation employs association-strength metrics, incorporates path-based node importance heuristics, allows for case-specific notions of importance, and adjusts based on the accuracy of previous suggestions. Interesting items are identified by leveraging both node attributes and network structure in a single computation. Our data set was systematically constructed from heterogeneous sources and omits many privacy-sensitive data elements such as case narratives and phone numbers. The flooding algorithm improved on both manual and link-weight-only computations, and our results suggest that the approach is robust across different interpretations of the user-provided heuristics. This study demonstrates an interesting methodology for including user-provided heuristics in network-based analysis, and can help guide the development of ISI-related analysis tools.

Authors

Years

Themes