-
Carmel, E.; Crawford, S.; Chen, H.: Browsing in hypertext : a cognitive study (1992)
0.04
0.036927395 = product of:
0.07385479 = sum of:
0.07385479 = sum of:
0.038503684 = weight(_text_:systems in 7469) [ClassicSimilarity], result of:
0.038503684 = score(doc=7469,freq=4.0), product of:
0.16037072 = queryWeight, product of:
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.052184064 = queryNorm
0.24009174 = fieldWeight in 7469, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.0390625 = fieldNorm(doc=7469)
0.0353511 = weight(_text_:22 in 7469) [ClassicSimilarity], result of:
0.0353511 = score(doc=7469,freq=2.0), product of:
0.1827397 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.052184064 = 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)
- 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
-
Chen, H.: Semantic research for digital libraries (1999)
0.01
0.014147157 = product of:
0.028294314 = sum of:
0.028294314 = product of:
0.056588627 = sum of:
0.056588627 = weight(_text_:systems in 1247) [ClassicSimilarity], result of:
0.056588627 = score(doc=1247,freq=6.0), product of:
0.16037072 = queryWeight, product of:
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.052184064 = queryNorm
0.35286134 = fieldWeight in 1247, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.046875 = fieldNorm(doc=1247)
0.5 = coord(1/2)
0.5 = coord(1/2)
- 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.: Machine learning for information retrieval : neural networks, symbolic learning, and genetic algorithms (1994)
0.01
0.009529176 = product of:
0.019058352 = sum of:
0.019058352 = product of:
0.038116705 = sum of:
0.038116705 = weight(_text_:systems in 2657) [ClassicSimilarity], result of:
0.038116705 = score(doc=2657,freq=2.0), product of:
0.16037072 = queryWeight, product of:
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.052184064 = queryNorm
0.23767869 = fieldWeight in 2657, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.0546875 = fieldNorm(doc=2657)
0.5 = coord(1/2)
0.5 = coord(1/2)
- 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
-
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.008167865 = product of:
0.01633573 = sum of:
0.01633573 = product of:
0.03267146 = sum of:
0.03267146 = weight(_text_:systems in 2203) [ClassicSimilarity], result of:
0.03267146 = score(doc=2203,freq=2.0), product of:
0.16037072 = queryWeight, product of:
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.052184064 = queryNorm
0.2037246 = fieldWeight in 2203, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.046875 = fieldNorm(doc=2203)
0.5 = coord(1/2)
0.5 = coord(1/2)
- 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
-
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.008167865 = product of:
0.01633573 = sum of:
0.01633573 = product of:
0.03267146 = sum of:
0.03267146 = weight(_text_:systems in 1148) [ClassicSimilarity], result of:
0.03267146 = score(doc=1148,freq=2.0), product of:
0.16037072 = queryWeight, product of:
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.052184064 = queryNorm
0.2037246 = fieldWeight in 1148, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.046875 = fieldNorm(doc=1148)
0.5 = coord(1/2)
0.5 = coord(1/2)
- 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
-
Chen, H.; Yim, T.; Fye, D.: Automatic thesaurus generation for an electronic community system (1995)
0.01
0.0068065543 = product of:
0.013613109 = sum of:
0.013613109 = product of:
0.027226217 = sum of:
0.027226217 = weight(_text_:systems in 2918) [ClassicSimilarity], result of:
0.027226217 = score(doc=2918,freq=2.0), product of:
0.16037072 = queryWeight, product of:
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.052184064 = queryNorm
0.1697705 = fieldWeight in 2918, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.0390625 = fieldNorm(doc=2918)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Reports an algorithmic approach to the automatic generation of thesauri for electronic community systems. The techniques used included terms filtering, automatic indexing, and cluster analysis. The testbed for the research was the Worm Community System, which contains a comprehensive library of specialized community data and literature, currently in use by molecular biologists who study the nematode worm. The resulting worm thesaurus included 2709 researchers' names, 798 gene names, 20 experimental methods, and 4302 subject descriptors. On average, each term had about 90 weighted neighbouring terms indicating relevant concepts. The thesaurus was developed as an online search aide. Tests the worm thesaurus in an experiment with 6 worm researchers of varying degrees of expertise and background. The experiment showed that the thesaurus was an excellent 'memory jogging' device and that it supported learning and serendipitous browsing. Despite some occurrences of obvious noise, the system was useful in suggesting relevant concepts for the researchers' queries and it helped improve concept recall. With a simple browsing interface, an automatic thesaurus can become a useful tool for online search and can assist researchers in exploring and traversing a dynamic and complex electronic community system
