-
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.01102379 = product of:
0.03307137 = sum of:
0.03307137 = product of:
0.0992141 = sum of:
0.0992141 = weight(_text_:network in 2203) [ClassicSimilarity], result of:
0.0992141 = score(doc=2203,freq=6.0), product of:
0.19402927 = queryWeight, product of:
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.043569047 = queryNorm
0.51133573 = fieldWeight in 2203, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.046875 = fieldNorm(doc=2203)
0.33333334 = coord(1/3)
0.33333334 = coord(1/3)
- 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.; Zhang, Y.; Houston, A.L.: Semantic indexing and searching using a Hopfield net (1998)
0.01
0.009000885 = product of:
0.027002655 = sum of:
0.027002655 = product of:
0.081007965 = sum of:
0.081007965 = weight(_text_:network in 5704) [ClassicSimilarity], result of:
0.081007965 = score(doc=5704,freq=4.0), product of:
0.19402927 = queryWeight, product of:
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.043569047 = queryNorm
0.41750383 = fieldWeight in 5704, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.046875 = fieldNorm(doc=5704)
0.33333334 = coord(1/3)
0.33333334 = coord(1/3)
- Abstract
- Presents a neural network approach to document semantic indexing. Reports results of a study to apply a Hopfield net algorithm to simulate human associative memory for concept exploration in the domain of computer science and engineering. The INSPEC database, consisting of 320.000 abstracts from leading periodical articles was used as the document test bed. Benchmark tests conformed that 3 parameters: maximum number of activated nodes; maximum allowable error; and maximum number of iterations; were useful in positively influencing network convergence behaviour without negatively impacting central processing unit performance. Another series of benchmark tests was performed to determine the effectiveness of various filtering techniques in reducing the negative impact of noisy input terms. Preliminary user tests conformed expectations that the Hopfield net is potentially useful as an associative memory technique to improve document recall and precision by solving discrepancies between indexer vocabularies and end user vocabularies
-
Chen, H.: Machine learning for information retrieval : neural networks, symbolic learning, and genetic algorithms (1994)
0.01
0.007425352 = product of:
0.022276055 = sum of:
0.022276055 = product of:
0.06682816 = sum of:
0.06682816 = weight(_text_:network in 2657) [ClassicSimilarity], result of:
0.06682816 = score(doc=2657,freq=2.0), product of:
0.19402927 = queryWeight, product of:
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.043569047 = queryNorm
0.3444231 = fieldWeight in 2657, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.0546875 = fieldNorm(doc=2657)
0.33333334 = coord(1/3)
0.33333334 = coord(1/3)
- 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
-
Orwig, R.E.; Chen, H.; Nunamaker, J.F.: ¬A graphical, self-organizing approach to classifying electronic meeting output (1997)
0.01
0.007425352 = product of:
0.022276055 = sum of:
0.022276055 = product of:
0.06682816 = sum of:
0.06682816 = weight(_text_:network in 6928) [ClassicSimilarity], result of:
0.06682816 = score(doc=6928,freq=2.0), product of:
0.19402927 = queryWeight, product of:
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.043569047 = queryNorm
0.3444231 = fieldWeight in 6928, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.0546875 = fieldNorm(doc=6928)
0.33333334 = coord(1/3)
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
-
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.0046329014 = product of:
0.013898704 = sum of:
0.013898704 = product of:
0.041696113 = sum of:
0.041696113 = weight(_text_:29 in 3922) [ClassicSimilarity], result of:
0.041696113 = score(doc=3922,freq=2.0), product of:
0.15326229 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.043569047 = queryNorm
0.27205724 = fieldWeight in 3922, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.0546875 = fieldNorm(doc=3922)
0.33333334 = coord(1/3)
0.33333334 = coord(1/3)
- Date
- 21. 7.1999 13:48:29
-
Carmel, E.; Crawford, S.; Chen, H.: Browsing in hypertext : a cognitive study (1992)
0.00
0.003279447 = product of:
0.009838341 = sum of:
0.009838341 = product of:
0.029515022 = sum of:
0.029515022 = weight(_text_:22 in 7469) [ClassicSimilarity], result of:
0.029515022 = score(doc=7469,freq=2.0), product of:
0.15257138 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043569047 = 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.33333334 = coord(1/3)
0.33333334 = coord(1/3)
- Source
- IEEE transactions on systems, man and cybernetics. 22(1992) no.5, S.865-884
