-
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.01
0.0053541656 = product of:
0.021416662 = sum of:
0.021416662 = weight(_text_:information in 1148) [ClassicSimilarity], result of:
0.021416662 = score(doc=1148,freq=18.0), product of:
0.06134496 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.034944877 = queryNorm
0.34911853 = fieldWeight in 1148, product of:
4.2426405 = tf(freq=18.0), with freq of:
18.0 = termFreq=18.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=1148)
0.25 = coord(1/4)
- 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
- Source
- Journal of the American Society for Information Science. 49(1998) no.8, S.693-705
-
Chen, H.: Semantic research for digital libraries (1999)
0.01
0.0053541656 = product of:
0.021416662 = sum of:
0.021416662 = weight(_text_:information in 1247) [ClassicSimilarity], result of:
0.021416662 = score(doc=1247,freq=18.0), product of:
0.06134496 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.034944877 = queryNorm
0.34911853 = fieldWeight in 1247, product of:
4.2426405 = tf(freq=18.0), with freq of:
18.0 = termFreq=18.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=1247)
0.25 = coord(1/4)
- Abstract
- In this era of the Internet and distributed, multimedia computing, new and emerging classes of information systems applications have swept into the lives of office workers and people in general. From digital libraries, multimedia systems, geographic information systems, and collaborative computing to electronic commerce, virtual reality, and electronic video arts and games, these applications have created tremendous opportunities for information and computer science researchers and practitioners. As applications become more pervasive, pressing, and diverse, several well-known information retrieval (IR) problems have become even more urgent. Information overload, a result of the ease of information creation and transmission via the Internet and WWW, has become more troublesome (e.g., even stockbrokers and elementary school students, heavily exposed to various WWW search engines, are versed in such IR terminology as recall and precision). Significant variations in database formats and structures, the richness of information media (text, audio, and video), and an abundance of multilingual information content also have created severe information interoperability problems -- structural interoperability, media interoperability, and multilingual interoperability.
-
Chen, H.: Explaining and alleviating information management indeterminism : a knowledge-based framework (1994)
0.01
0.0053210123 = product of:
0.02128405 = sum of:
0.02128405 = weight(_text_:information in 8221) [ClassicSimilarity], result of:
0.02128405 = score(doc=8221,freq=10.0), product of:
0.06134496 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.034944877 = queryNorm
0.3469568 = fieldWeight in 8221, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0625 = fieldNorm(doc=8221)
0.25 = coord(1/4)
- 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
- Source
- Information processing and management. 30(1994) no.4, S.557-577
-
Chen, H.: Machine learning for information retrieval : neural networks, symbolic learning, and genetic algorithms (1994)
0.01
0.0051002675 = product of:
0.02040107 = sum of:
0.02040107 = weight(_text_:information in 2657) [ClassicSimilarity], result of:
0.02040107 = score(doc=2657,freq=12.0), product of:
0.06134496 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.034944877 = queryNorm
0.3325631 = fieldWeight in 2657, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0546875 = fieldNorm(doc=2657)
0.25 = coord(1/4)
- 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
- Source
- Journal of the American Society for Information Science. 46(1995) no.3, S.194-216
-
Chen, H.: Knowledge-based document retrieval : framework and design (1992)
0.00
0.004759258 = product of:
0.019037032 = sum of:
0.019037032 = weight(_text_:information in 5283) [ClassicSimilarity], result of:
0.019037032 = score(doc=5283,freq=2.0), product of:
0.06134496 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.034944877 = queryNorm
0.3103276 = fieldWeight in 5283, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.125 = fieldNorm(doc=5283)
0.25 = coord(1/4)
- Source
- Journal of information science. 18(1992), S.293-314
-
Chen, H.; Dhar, V.: Cognitive process as a basis for intelligent retrieval system design (1991)
0.00
0.004121639 = product of:
0.016486555 = sum of:
0.016486555 = weight(_text_:information in 3845) [ClassicSimilarity], result of:
0.016486555 = score(doc=3845,freq=6.0), product of:
0.06134496 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.034944877 = queryNorm
0.2687516 = fieldWeight in 3845, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0625 = fieldNorm(doc=3845)
0.25 = coord(1/4)
- 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
- Source
- Information processing and management. 27(1991) no.5, S.405-432
-
Chen, H.; Ng, T.D.; Martinez, J.; Schatz, B.R.: ¬A concept space approach to addressing the vocabulary problem in scientific information retrieval : an experiment on the Worm Community System (1997)
0.00
0.0033256328 = product of:
0.013302531 = sum of:
0.013302531 = weight(_text_:information in 6492) [ClassicSimilarity], result of:
0.013302531 = score(doc=6492,freq=10.0), product of:
0.06134496 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.034944877 = queryNorm
0.21684799 = fieldWeight in 6492, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0390625 = fieldNorm(doc=6492)
0.25 = coord(1/4)
- Abstract
- This research presents an algorithmic approach to addressing the vocabulary problem in scientific information retrieval and information sharing, using the molecular biology domain as an example. We first present a literature review of cognitive studies related to the vocabulary problem and vocabulary-based search aids (thesauri) and then discuss techniques for building robust and domain-specific thesauri to assist in cross-domain scientific information retrieval. Using a variation of the automatic thesaurus generation techniques, which we refer to as the concept space approach, we recently conducted an experiment in the molecular biology domain in which we created a C. elegans worm thesaurus of 7.657 worm-specific terms and a Drosophila fly thesaurus of 15.626 terms. About 30% of these terms overlapped, which created vocabulary paths from one subject domain to the other. Based on a cognitve study of term association involving 4 biologists, we found that a large percentage (59,6-85,6%) of the terms suggested by the subjects were identified in the cojoined fly-worm thesaurus. However, we found only a small percentage (8,4-18,1%) of the associations suggested by the subjects in the thesaurus
- Source
- Journal of the American Society for Information Science. 48(1997) no.1, S.17-31
-
Carmel, E.; Crawford, S.; Chen, H.: Browsing in hypertext : a cognitive study (1992)
0.00
0.0029745363 = product of:
0.011898145 = sum of:
0.011898145 = weight(_text_:information in 7469) [ClassicSimilarity], result of:
0.011898145 = score(doc=7469,freq=8.0), product of:
0.06134496 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.034944877 = queryNorm
0.19395474 = fieldWeight in 7469, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0390625 = fieldNorm(doc=7469)
0.25 = coord(1/4)
- 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
-
Schatz, B.R.; Johnson, E.H.; Cochrane, P.A.; Chen, H.: Interactive term suggestion for users of digital libraries : using thesauri and co-occurrence lists for information retrieval (1996)
0.00
0.0029745363 = product of:
0.011898145 = sum of:
0.011898145 = weight(_text_:information in 6417) [ClassicSimilarity], result of:
0.011898145 = score(doc=6417,freq=2.0), product of:
0.06134496 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.034944877 = queryNorm
0.19395474 = fieldWeight in 6417, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.078125 = fieldNorm(doc=6417)
0.25 = coord(1/4)
-
Chen, H.; Martinez, J.; Kirchhoff, A.; Ng, T.D.; Schatz, B.R.: Alleviating search uncertainty through concept associations : automatic indexing, co-occurence analysis, and parallel computing (1998)
0.00
0.0025239778 = product of:
0.010095911 = sum of:
0.010095911 = weight(_text_:information in 5202) [ClassicSimilarity], result of:
0.010095911 = score(doc=5202,freq=4.0), product of:
0.06134496 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.034944877 = queryNorm
0.16457605 = fieldWeight in 5202, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=5202)
0.25 = coord(1/4)
- Abstract
- In this article, we report research on an algorithmic approach to alleviating search uncertainty in a large information space. Grounded on object filtering, automatic indexing, and co-occurence analysis, we performed a large-scale experiment using a parallel supercomputer (SGI Power Challenge) to analyze 400.000+ abstracts in an INSPEC computer engineering collection. Two system-generated thesauri, one based on a combined object filtering and automatic indexing method, and the other based on automatic indexing only, were compaed with the human-generated INSPEC subject thesaurus. Our user evaluation revealed that the system-generated thesauri were better than the INSPEC thesaurus in 'concept recall', but in 'concept precision' the 3 thesauri were comparable. Our analysis also revealed that the terms suggested by the 3 thesauri were complementary and could be used to significantly increase 'variety' in search terms the thereby reduce search uncertainty
- Source
- Journal of the American Society for Information Science. 49(1998) no.3, S.206-216
-
Chen, H.; Houston, A.L.; Sewell, R.R.; Schatz, B.R.: Internet browsing and searching : user evaluations of category map and concept space techniques (1998)
0.00
0.002379629 = product of:
0.009518516 = sum of:
0.009518516 = weight(_text_:information in 869) [ClassicSimilarity], result of:
0.009518516 = score(doc=869,freq=8.0), product of:
0.06134496 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.034944877 = queryNorm
0.1551638 = fieldWeight in 869, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.03125 = fieldNorm(doc=869)
0.25 = coord(1/4)
- 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
- Source
- Journal of the American Society for Information Science. 49(1998) no.7, S.582-603
-
Ramsey, M.C.; Chen, H.; Zhu, B.; Schatz, B.R.: ¬A collection of visual thesauri for browsing large collections of geographic images (1999)
0.00
0.0020821756 = product of:
0.008328702 = sum of:
0.008328702 = weight(_text_:information in 3922) [ClassicSimilarity], result of:
0.008328702 = score(doc=3922,freq=2.0), product of:
0.06134496 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.034944877 = queryNorm
0.13576832 = fieldWeight in 3922, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0546875 = fieldNorm(doc=3922)
0.25 = coord(1/4)
- Source
- Journal of the American Society for Information Science. 50(1999) no.9, S.826-834
-
Orwig, R.E.; Chen, H.; Nunamaker, J.F.: ¬A graphical, self-organizing approach to classifying electronic meeting output (1997)
0.00
0.0020821756 = product of:
0.008328702 = sum of:
0.008328702 = weight(_text_:information in 6928) [ClassicSimilarity], result of:
0.008328702 = score(doc=6928,freq=2.0), product of:
0.06134496 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.034944877 = queryNorm
0.13576832 = fieldWeight in 6928, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0546875 = fieldNorm(doc=6928)
0.25 = coord(1/4)
- Source
- Journal of the American Society for Information Science. 48(1997) no.2, S.157-170
-
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.00
0.0017847219 = product of:
0.0071388874 = sum of:
0.0071388874 = weight(_text_:information in 2203) [ClassicSimilarity], result of:
0.0071388874 = score(doc=2203,freq=2.0), product of:
0.06134496 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.034944877 = queryNorm
0.116372846 = fieldWeight in 2203, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=2203)
0.25 = coord(1/4)
- Source
- Journal of the American Society for Information Science. 46(1995) no.5, S.348-369
-
Chen, H.; Zhang, Y.; Houston, A.L.: Semantic indexing and searching using a Hopfield net (1998)
0.00
0.0017847219 = product of:
0.0071388874 = sum of:
0.0071388874 = weight(_text_:information in 5704) [ClassicSimilarity], result of:
0.0071388874 = score(doc=5704,freq=2.0), product of:
0.06134496 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.034944877 = queryNorm
0.116372846 = fieldWeight in 5704, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=5704)
0.25 = coord(1/4)
- Source
- Journal of information science. 24(1998) no.1, S.3-18
-
Chen, H.; Yim, T.; Fye, D.: Automatic thesaurus generation for an electronic community system (1995)
0.00
0.0014872681 = product of:
0.0059490725 = sum of:
0.0059490725 = weight(_text_:information in 2918) [ClassicSimilarity], result of:
0.0059490725 = score(doc=2918,freq=2.0), product of:
0.06134496 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.034944877 = queryNorm
0.09697737 = fieldWeight in 2918, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0390625 = fieldNorm(doc=2918)
0.25 = coord(1/4)
- Source
- Journal of the American Society for Information Science. 46(1995) no.3, S.175-193
-
Chen, H.; Chung, Y.-M.; Ramsey, M.; Yang, C.C.: ¬A smart itsy bitsy spider for the Web (1998)
0.00
0.0014872681 = product of:
0.0059490725 = sum of:
0.0059490725 = weight(_text_:information in 871) [ClassicSimilarity], result of:
0.0059490725 = score(doc=871,freq=2.0), product of:
0.06134496 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.034944877 = queryNorm
0.09697737 = fieldWeight in 871, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0390625 = fieldNorm(doc=871)
0.25 = coord(1/4)
- Source
- Journal of the American Society for Information Science. 49(1998) no.7, S.604-618
