-
Chung, W.; Chen, H.: Browsing the underdeveloped Web : an experiment on the Arabic Medical Web Directory (2009)
0.06
0.05562249 = product of:
0.08343373 = sum of:
0.016950073 = weight(_text_:in in 2733) [ClassicSimilarity], result of:
0.016950073 = score(doc=2733,freq=14.0), product of:
0.07104705 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.052230705 = queryNorm
0.23857531 = fieldWeight in 2733, product of:
3.7416575 = tf(freq=14.0), with freq of:
14.0 = termFreq=14.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.046875 = fieldNorm(doc=2733)
0.06648366 = sum of:
0.024024425 = weight(_text_:science in 2733) [ClassicSimilarity], result of:
0.024024425 = score(doc=2733,freq=2.0), product of:
0.1375819 = queryWeight, product of:
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.052230705 = queryNorm
0.17461908 = fieldWeight in 2733, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.046875 = fieldNorm(doc=2733)
0.042459235 = weight(_text_:22 in 2733) [ClassicSimilarity], result of:
0.042459235 = score(doc=2733,freq=2.0), product of:
0.18290302 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.052230705 = 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.6666667 = coord(2/3)
- Abstract
- While the Web has grown significantly in recent years, some portions of the Web remain largely underdeveloped, as shown in a lack of high-quality content and functionality. An example is the Arabic Web, in which a lack of well-structured Web directories limits users' ability to browse for Arabic resources. In this research, we proposed an approach to building Web directories for the underdeveloped Web and developed a proof-of-concept prototype called the Arabic Medical Web Directory (AMedDir) that supports browsing of over 5,000 Arabic medical Web sites and pages organized in a hierarchical structure. We conducted an experiment involving Arab participants and found that the AMedDir significantly outperformed two benchmark Arabic Web directories in terms of browsing effectiveness, efficiency, information quality, and user satisfaction. Participants expressed strong preference for the AMedDir and provided many positive comments. This research thus contributes to developing a useful Web directory for organizing the information in the Arabic medical domain and to a better understanding of how to support browsing on the underdeveloped Web.
- Date
- 22. 3.2009 17:57:50
- Source
- Journal of the American Society for Information Science and Technology. 60(2009) no.3, S.595-607
-
Hu, D.; Kaza, S.; Chen, H.: Identifying significant facilitators of dark network evolution (2009)
0.05
0.047002252 = product of:
0.07050338 = sum of:
0.015100324 = weight(_text_:in in 2753) [ClassicSimilarity], result of:
0.015100324 = score(doc=2753,freq=16.0), product of:
0.07104705 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.052230705 = queryNorm
0.21253976 = fieldWeight in 2753, product of:
4.0 = tf(freq=16.0), with freq of:
16.0 = termFreq=16.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0390625 = fieldNorm(doc=2753)
0.05540305 = sum of:
0.020020355 = weight(_text_:science in 2753) [ClassicSimilarity], result of:
0.020020355 = score(doc=2753,freq=2.0), product of:
0.1375819 = queryWeight, product of:
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.052230705 = queryNorm
0.1455159 = fieldWeight in 2753, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.0390625 = fieldNorm(doc=2753)
0.035382695 = weight(_text_:22 in 2753) [ClassicSimilarity], result of:
0.035382695 = score(doc=2753,freq=2.0), product of:
0.18290302 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.052230705 = 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.6666667 = coord(2/3)
- Abstract
- Social networks evolve over time with the addition and removal of nodes and links to survive and thrive in their environments. Previous studies have shown that the link-formation process in such networks is influenced by a set of facilitators. However, there have been few empirical evaluations to determine the important facilitators. In a research partnership with law enforcement agencies, we used dynamic social-network analysis methods to examine several plausible facilitators of co-offending relationships in a large-scale narcotics network consisting of individuals and vehicles. Multivariate Cox regression and a two-proportion z-test on cyclic and focal closures of the network showed that mutual acquaintance and vehicle affiliations were significant facilitators for the network under study. We also found that homophily with respect to age, race, and gender were not good predictors of future link formation in these networks. Moreover, we examined the social causes and policy implications for the significance and insignificance of various facilitators including common jails on future co-offending. These findings provide important insights into the link-formation processes and the resilience of social networks. In addition, they can be used to aid in the prediction of future links. The methods described can also help in understanding the driving forces behind the formation and evolution of social networks facilitated by mobile and Web technologies.
- Date
- 22. 3.2009 18:50:30
- Source
- Journal of the American Society for Information Science and Technology. 60(2009) no.4, S.655-665
-
Leroy, G.; Chen, H.: Genescene: an ontology-enhanced integration of linguistic and co-occurrence based relations in biomedical texts (2005)
0.04
0.044893935 = product of:
0.0673409 = sum of:
0.011937855 = weight(_text_:in in 5259) [ClassicSimilarity], result of:
0.011937855 = score(doc=5259,freq=10.0), product of:
0.07104705 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.052230705 = queryNorm
0.16802745 = fieldWeight in 5259, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0390625 = fieldNorm(doc=5259)
0.05540305 = sum of:
0.020020355 = weight(_text_:science in 5259) [ClassicSimilarity], result of:
0.020020355 = score(doc=5259,freq=2.0), product of:
0.1375819 = queryWeight, product of:
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.052230705 = queryNorm
0.1455159 = fieldWeight in 5259, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.0390625 = fieldNorm(doc=5259)
0.035382695 = weight(_text_:22 in 5259) [ClassicSimilarity], result of:
0.035382695 = score(doc=5259,freq=2.0), product of:
0.18290302 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.052230705 = 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.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
- Footnote
- Beitrag in einem special issue on bioinformatics
- Source
- Journal of the American Society for Information Science and Technology. 56(2005) no.5, S.457-468
-
Zheng, R.; Li, J.; Chen, H.; Huang, Z.: ¬A framework for authorship identification of online messages : writing-style features and classification techniques (2006)
0.04
0.04310005 = product of:
0.06465007 = sum of:
0.009247023 = weight(_text_:in in 5276) [ClassicSimilarity], result of:
0.009247023 = score(doc=5276,freq=6.0), product of:
0.07104705 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.052230705 = queryNorm
0.1301535 = fieldWeight in 5276, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0390625 = fieldNorm(doc=5276)
0.05540305 = sum of:
0.020020355 = weight(_text_:science in 5276) [ClassicSimilarity], result of:
0.020020355 = score(doc=5276,freq=2.0), product of:
0.1375819 = queryWeight, product of:
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.052230705 = queryNorm
0.1455159 = fieldWeight in 5276, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.0390625 = fieldNorm(doc=5276)
0.035382695 = weight(_text_:22 in 5276) [ClassicSimilarity], result of:
0.035382695 = score(doc=5276,freq=2.0), product of:
0.18290302 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.052230705 = 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.6666667 = coord(2/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
- Source
- Journal of the American Society for Information Science and Technology. 57(2006) no.3, S.378-393
-
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.02517056 = product of:
0.03775584 = sum of:
0.016950073 = weight(_text_:in in 1148) [ClassicSimilarity], result of:
0.016950073 = score(doc=1148,freq=14.0), product of:
0.07104705 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.052230705 = queryNorm
0.23857531 = fieldWeight in 1148, product of:
3.7416575 = tf(freq=14.0), with freq of:
14.0 = termFreq=14.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.046875 = fieldNorm(doc=1148)
0.020805765 = product of:
0.04161153 = sum of:
0.04161153 = weight(_text_:science in 1148) [ClassicSimilarity], result of:
0.04161153 = score(doc=1148,freq=6.0), product of:
0.1375819 = queryWeight, product of:
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.052230705 = queryNorm
0.30244917 = fieldWeight in 1148, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.046875 = fieldNorm(doc=1148)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- 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
-
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.02126813 = product of:
0.031902194 = sum of:
0.011096427 = weight(_text_:in in 1823) [ClassicSimilarity], result of:
0.011096427 = score(doc=1823,freq=6.0), product of:
0.07104705 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.052230705 = queryNorm
0.1561842 = fieldWeight in 1823, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.046875 = fieldNorm(doc=1823)
0.020805765 = product of:
0.04161153 = sum of:
0.04161153 = weight(_text_:science in 1823) [ClassicSimilarity], result of:
0.04161153 = score(doc=1823,freq=6.0), product of:
0.1375819 = queryWeight, product of:
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.052230705 = queryNorm
0.30244917 = fieldWeight in 1823, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.046875 = fieldNorm(doc=1823)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- 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.
- Source
- Journal of the Association for Information Science and Technology. 66(2015) no.5, S.1017-1029
-
Chau, M.; Wong, C.H.; Zhou, Y.; Qin, J.; Chen, H.: Evaluating the use of search engine development tools in IT education (2010)
0.02
0.020692803 = product of:
0.031039204 = sum of:
0.016882677 = weight(_text_:in in 3325) [ClassicSimilarity], result of:
0.016882677 = score(doc=3325,freq=20.0), product of:
0.07104705 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.052230705 = queryNorm
0.2376267 = fieldWeight in 3325, product of:
4.472136 = tf(freq=20.0), with freq of:
20.0 = termFreq=20.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0390625 = fieldNorm(doc=3325)
0.014156529 = product of:
0.028313057 = sum of:
0.028313057 = weight(_text_:science in 3325) [ClassicSimilarity], result of:
0.028313057 = score(doc=3325,freq=4.0), product of:
0.1375819 = queryWeight, product of:
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.052230705 = queryNorm
0.20579056 = fieldWeight in 3325, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.0390625 = fieldNorm(doc=3325)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- It is important for education in computer science and information systems to keep up to date with the latest development in technology. With the rapid development of the Internet and the Web, many schools have included Internet-related technologies, such as Web search engines and e-commerce, as part of their curricula. Previous research has shown that it is effective to use search engine development tools to facilitate students' learning. However, the effectiveness of these tools in the classroom has not been evaluated. In this article, we review the design of three search engine development tools, SpidersRUs, Greenstone, and Alkaline, followed by an evaluation study that compared the three tools in the classroom. In the study, 33 students were divided into 13 groups and each group used the three tools to develop three independent search engines in a class project. Our evaluation results showed that SpidersRUs performed better than the two other tools in overall satisfaction and the level of knowledge gained in their learning experience when using the tools for a class project on Internet applications development.
- Source
- Journal of the American Society for Information Science and Technology. 61(2010) no.2, S.288-299
-
Chen, H.; Zhang, Y.; Houston, A.L.: Semantic indexing and searching using a Hopfield net (1998)
0.02
0.019867256 = product of:
0.029800884 = sum of:
0.012813049 = weight(_text_:in in 5704) [ClassicSimilarity], result of:
0.012813049 = score(doc=5704,freq=8.0), product of:
0.07104705 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.052230705 = queryNorm
0.18034597 = fieldWeight in 5704, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.046875 = fieldNorm(doc=5704)
0.016987834 = product of:
0.03397567 = sum of:
0.03397567 = weight(_text_:science in 5704) [ClassicSimilarity], result of:
0.03397567 = score(doc=5704,freq=4.0), product of:
0.1375819 = queryWeight, product of:
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.052230705 = queryNorm
0.24694869 = fieldWeight in 5704, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.046875 = fieldNorm(doc=5704)
0.5 = coord(1/2)
0.6666667 = coord(2/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
- Source
- Journal of information science. 24(1998) no.1, S.3-18
- Theme
- Semantisches Umfeld in Indexierung u. Retrieval
-
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.02
0.01930819 = product of:
0.028962284 = sum of:
0.016950073 = weight(_text_:in in 5202) [ClassicSimilarity], result of:
0.016950073 = score(doc=5202,freq=14.0), product of:
0.07104705 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.052230705 = queryNorm
0.23857531 = fieldWeight in 5202, product of:
3.7416575 = tf(freq=14.0), with freq of:
14.0 = termFreq=14.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.046875 = fieldNorm(doc=5202)
0.012012213 = product of:
0.024024425 = sum of:
0.024024425 = weight(_text_:science in 5202) [ClassicSimilarity], result of:
0.024024425 = score(doc=5202,freq=2.0), product of:
0.1375819 = queryWeight, product of:
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.052230705 = queryNorm
0.17461908 = fieldWeight in 5202, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.046875 = fieldNorm(doc=5202)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- 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
- Theme
- Semantisches Umfeld in Indexierung u. Retrieval
-
Chen, H.: Introduction to the JASIST special topic section on Web retrieval and mining : A machine learning perspective (2003)
0.02
0.01930819 = product of:
0.028962284 = sum of:
0.016950073 = weight(_text_:in in 1610) [ClassicSimilarity], result of:
0.016950073 = score(doc=1610,freq=14.0), product of:
0.07104705 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.052230705 = queryNorm
0.23857531 = fieldWeight in 1610, product of:
3.7416575 = tf(freq=14.0), with freq of:
14.0 = termFreq=14.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.046875 = fieldNorm(doc=1610)
0.012012213 = product of:
0.024024425 = sum of:
0.024024425 = weight(_text_:science in 1610) [ClassicSimilarity], result of:
0.024024425 = score(doc=1610,freq=2.0), product of:
0.1375819 = queryWeight, product of:
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.052230705 = queryNorm
0.17461908 = fieldWeight in 1610, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.046875 = fieldNorm(doc=1610)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- Research in information retrieval (IR) has advanced significantly in the past few decades. Many tasks, such as indexing and text categorization, can be performed automatically with minimal human effort. Machine learning has played an important role in such automation by learning various patterns such as document topics, text structures, and user interests from examples. In recent years, it has become increasingly difficult to search for useful information an the World Wide Web because of its large size and unstructured nature. Useful information and resources are often hidden in the Web. While machine learning has been successfully applied to traditional IR systems, it poses some new challenges to apply these algorithms to the Web due to its large size, link structure, diversity in content and languages, and dynamic nature. On the other hand, such characteristics of the Web also provide interesting patterns and knowledge that do not present in traditional information retrieval systems.
- Source
- Journal of the American Society for Information Science and technology. 54(2003) no.7, S.621-624
-
Qin, J.; Zhou, Y.; Chau, M.; Chen, H.: Multilingual Web retrieval : an experiment in English-Chinese business intelligence (2006)
0.02
0.019002816 = product of:
0.028504223 = sum of:
0.018494045 = weight(_text_:in in 5054) [ClassicSimilarity], result of:
0.018494045 = score(doc=5054,freq=24.0), product of:
0.07104705 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.052230705 = queryNorm
0.260307 = fieldWeight in 5054, product of:
4.8989797 = tf(freq=24.0), with freq of:
24.0 = termFreq=24.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0390625 = fieldNorm(doc=5054)
0.010010177 = product of:
0.020020355 = sum of:
0.020020355 = weight(_text_:science in 5054) [ClassicSimilarity], result of:
0.020020355 = score(doc=5054,freq=2.0), product of:
0.1375819 = queryWeight, product of:
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.052230705 = queryNorm
0.1455159 = fieldWeight in 5054, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.0390625 = fieldNorm(doc=5054)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- As increasing numbers of non-English resources have become available on the Web, the interesting and important issue of how Web users can retrieve documents in different languages has arisen. Cross-language information retrieval (CLIP), the study of retrieving information in one language by queries expressed in another language, is a promising approach to the problem. Cross-language information retrieval has attracted much attention in recent years. Most research systems have achieved satisfactory performance on standard Text REtrieval Conference (TREC) collections such as news articles, but CLIR techniques have not been widely studied and evaluated for applications such as Web portals. In this article, the authors present their research in developing and evaluating a multilingual English-Chinese Web portal that incorporates various CLIP techniques for use in the business domain. A dictionary-based approach was adopted and combines phrasal translation, co-occurrence analysis, and pre- and posttranslation query expansion. The portal was evaluated by domain experts, using a set of queries in both English and Chinese. The experimental results showed that co-occurrence-based phrasal translation achieved a 74.6% improvement in precision over simple word-byword translation. When used together, pre- and posttranslation query expansion improved the performance slightly, achieving a 78.0% improvement over the baseline word-by-word translation approach. In general, applying CLIR techniques in Web applications shows promise.
- Source
- Journal of the American Society for Information Science and Technology. 57(2006) no.5, S.671-683
-
Carmel, E.; Crawford, S.; Chen, H.: Browsing in hypertext : a cognitive study (1992)
0.02
0.018912595 = product of:
0.02836889 = sum of:
0.010677542 = weight(_text_:in in 7469) [ClassicSimilarity], result of:
0.010677542 = score(doc=7469,freq=8.0), product of:
0.07104705 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.052230705 = queryNorm
0.15028831 = fieldWeight in 7469, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0390625 = fieldNorm(doc=7469)
0.017691348 = product of:
0.035382695 = sum of:
0.035382695 = weight(_text_:22 in 7469) [ClassicSimilarity], result of:
0.035382695 = score(doc=7469,freq=2.0), product of:
0.18290302 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.052230705 = 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.6666667 = coord(2/3)
- 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
-
Liu, X.; Kaza, S.; Zhang, P.; Chen, H.: Determining inventor status and its effect on knowledge diffusion : a study on nanotechnology literature from China, Russia, and India (2011)
0.02
0.018854395 = product of:
0.02828159 = sum of:
0.014125061 = weight(_text_:in in 4468) [ClassicSimilarity], result of:
0.014125061 = score(doc=4468,freq=14.0), product of:
0.07104705 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.052230705 = queryNorm
0.19881277 = fieldWeight in 4468, product of:
3.7416575 = tf(freq=14.0), with freq of:
14.0 = termFreq=14.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0390625 = fieldNorm(doc=4468)
0.014156529 = product of:
0.028313057 = sum of:
0.028313057 = weight(_text_:science in 4468) [ClassicSimilarity], result of:
0.028313057 = score(doc=4468,freq=4.0), product of:
0.1375819 = queryWeight, product of:
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.052230705 = queryNorm
0.20579056 = fieldWeight in 4468, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.0390625 = fieldNorm(doc=4468)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- In an increasingly global research landscape, it is important to identify the most prolific researchers in various institutions and their influence on the diffusion of knowledge. Knowledge diffusion within institutions is influenced by not just the status of individual researchers but also the collaborative culture that determines status. There are various methods to measure individual status, but few studies have compared them or explored the possible effects of different cultures on the status measures. In this article, we examine knowledge diffusion within science and technology-oriented research organizations. Using social network analysis metrics to measure individual status in large-scale coauthorship networks, we studied an individual's impact on the recombination of knowledge to produce innovation in nanotechnology. Data from the most productive and high-impact institutions in China (Chinese Academy of Sciences), Russia (Russian Academy of Sciences), and India (Indian Institutes of Technology) were used. We found that boundary-spanning individuals influenced knowledge diffusion in all countries. However, our results also indicate that cultural and institutional differences may influence knowledge diffusion.
- Source
- Journal of the American Society for Information Science and Technology. 62(2011) no.6, S.1166-1176
-
Chen, H.: Machine learning for information retrieval : neural networks, symbolic learning, and genetic algorithms (1994)
0.02
0.017973388 = product of:
0.02696008 = sum of:
0.012945832 = weight(_text_:in in 2657) [ClassicSimilarity], result of:
0.012945832 = score(doc=2657,freq=6.0), product of:
0.07104705 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.052230705 = queryNorm
0.1822149 = fieldWeight in 2657, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0546875 = fieldNorm(doc=2657)
0.014014249 = product of:
0.028028497 = sum of:
0.028028497 = weight(_text_:science in 2657) [ClassicSimilarity], result of:
0.028028497 = score(doc=2657,freq=2.0), product of:
0.1375819 = queryWeight, product of:
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.052230705 = queryNorm
0.20372227 = fieldWeight in 2657, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.0546875 = fieldNorm(doc=2657)
0.5 = coord(1/2)
0.6666667 = coord(2/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
- Source
- Journal of the American Society for Information Science. 46(1995) no.3, S.194-216
-
Ramsey, M.C.; Chen, H.; Zhu, B.; Schatz, B.R.: ¬A collection of visual thesauri for browsing large collections of geographic images (1999)
0.02
0.017973388 = product of:
0.02696008 = sum of:
0.012945832 = weight(_text_:in in 3922) [ClassicSimilarity], result of:
0.012945832 = score(doc=3922,freq=6.0), product of:
0.07104705 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.052230705 = queryNorm
0.1822149 = fieldWeight in 3922, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0546875 = fieldNorm(doc=3922)
0.014014249 = product of:
0.028028497 = sum of:
0.028028497 = weight(_text_:science in 3922) [ClassicSimilarity], result of:
0.028028497 = score(doc=3922,freq=2.0), product of:
0.1375819 = queryWeight, product of:
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.052230705 = queryNorm
0.20372227 = fieldWeight in 3922, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.0546875 = fieldNorm(doc=3922)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- Digital libraries of geo-spatial multimedia content are currently deficient in providing fuzzy, concept-based retrieval mechanisms to users. The main challenge is that indexing and thesaurus creation are extremely labor-intensive processes for text documents and especially for images. Recently, 800.000 declassified staellite photographs were made available by the US Geological Survey. Additionally, millions of satellite and aerial photographs are archived in national and local map libraries. Such enormous collections make human indexing and thesaurus generation methods impossible to utilize. In this article we propose a scalable method to automatically generate visual thesauri of large collections of geo-spatial media using fuzzy, unsupervised machine-learning techniques
- Source
- Journal of the American Society for Information Science. 50(1999) no.9, S.826-834
-
Chen, H.: ¬An analysis of image queries in the field of art history (2001)
0.02
0.017973388 = product of:
0.02696008 = sum of:
0.012945832 = weight(_text_:in in 5187) [ClassicSimilarity], result of:
0.012945832 = score(doc=5187,freq=6.0), product of:
0.07104705 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.052230705 = queryNorm
0.1822149 = fieldWeight in 5187, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0546875 = fieldNorm(doc=5187)
0.014014249 = product of:
0.028028497 = sum of:
0.028028497 = weight(_text_:science in 5187) [ClassicSimilarity], result of:
0.028028497 = score(doc=5187,freq=2.0), product of:
0.1375819 = queryWeight, product of:
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.052230705 = queryNorm
0.20372227 = fieldWeight in 5187, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.0546875 = fieldNorm(doc=5187)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- Chen arranged with an Art History instructor to require 20 medieval art images in papers received from 29 students. Participants completed a self administered presearch and postsearch questionnaire, and were interviewed after questionnaire analysis, in order to collect both the keywords and phrases they planned to use, and those actually used. Three MLIS student reviewers then mapped the queries to Enser and McGregor's four categories, Jorgensen's 12 classes, and Fidel's 12 feature data and object poles providing a degree of match on a seven point scale (one not at all to 7 exact). The reviewers give highest scores to Enser and McGregor;'s categories. Modifications to both the Enser and McGregor and Jorgensen schemes are suggested
- Source
- Journal of the American Society for Information Science and technology. 52(2001) no.3, S.260-273
-
Chau, M.; Shiu, B.; Chan, M.; Chen, H.: Redips: backlink search and analysis on the Web for business intelligence analysis (2007)
0.02
0.016740335 = product of:
0.025110502 = sum of:
0.015100324 = weight(_text_:in in 142) [ClassicSimilarity], result of:
0.015100324 = score(doc=142,freq=16.0), product of:
0.07104705 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.052230705 = queryNorm
0.21253976 = fieldWeight in 142, product of:
4.0 = tf(freq=16.0), with freq of:
16.0 = termFreq=16.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0390625 = fieldNorm(doc=142)
0.010010177 = product of:
0.020020355 = sum of:
0.020020355 = weight(_text_:science in 142) [ClassicSimilarity], result of:
0.020020355 = score(doc=142,freq=2.0), product of:
0.1375819 = queryWeight, product of:
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.052230705 = queryNorm
0.1455159 = fieldWeight in 142, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.0390625 = fieldNorm(doc=142)
0.5 = coord(1/2)
0.6666667 = coord(2/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.
- Source
- Journal of the American Society for Information Science and Technology. 58(2007) no.3, S.351-365
-
Yang, M.; Kiang, M.; Chen, H.; Li, Y.: Artificial immune system for illicit content identification in social media (2012)
0.02
0.016740335 = product of:
0.025110502 = sum of:
0.015100324 = weight(_text_:in in 4980) [ClassicSimilarity], result of:
0.015100324 = score(doc=4980,freq=16.0), product of:
0.07104705 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.052230705 = queryNorm
0.21253976 = fieldWeight in 4980, product of:
4.0 = tf(freq=16.0), with freq of:
16.0 = termFreq=16.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0390625 = fieldNorm(doc=4980)
0.010010177 = product of:
0.020020355 = sum of:
0.020020355 = weight(_text_:science in 4980) [ClassicSimilarity], result of:
0.020020355 = score(doc=4980,freq=2.0), product of:
0.1375819 = queryWeight, product of:
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.052230705 = queryNorm
0.1455159 = fieldWeight in 4980, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.0390625 = fieldNorm(doc=4980)
0.5 = coord(1/2)
0.6666667 = coord(2/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.
- Source
- Journal of the American Society for Information Science and Technology. 63(2012) no.2, S.256-269
-
Marshall, B.; Chen, H.; Kaza, S.: Using importance flooding to identify interesting networks of criminal activity (2008)
0.02
0.016556047 = product of:
0.02483407 = sum of:
0.010677542 = weight(_text_:in in 2386) [ClassicSimilarity], result of:
0.010677542 = score(doc=2386,freq=8.0), product of:
0.07104705 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.052230705 = queryNorm
0.15028831 = fieldWeight in 2386, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0390625 = fieldNorm(doc=2386)
0.014156529 = product of:
0.028313057 = sum of:
0.028313057 = weight(_text_:science in 2386) [ClassicSimilarity], result of:
0.028313057 = score(doc=2386,freq=4.0), product of:
0.1375819 = queryWeight, product of:
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.052230705 = queryNorm
0.20579056 = fieldWeight in 2386, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.0390625 = fieldNorm(doc=2386)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- 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.
- Source
- Journal of the American Society for Information Science and Technology. 59(2008) no.13, S.2099-2114
-
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.02
0.016550176 = product of:
0.024825262 = sum of:
0.012813049 = weight(_text_:in in 2203) [ClassicSimilarity], result of:
0.012813049 = score(doc=2203,freq=8.0), product of:
0.07104705 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.052230705 = queryNorm
0.18034597 = fieldWeight in 2203, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.046875 = fieldNorm(doc=2203)
0.012012213 = product of:
0.024024425 = sum of:
0.024024425 = weight(_text_:science in 2203) [ClassicSimilarity], result of:
0.024024425 = score(doc=2203,freq=2.0), product of:
0.1375819 = queryWeight, product of:
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.052230705 = queryNorm
0.17461908 = fieldWeight in 2203, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.046875 = fieldNorm(doc=2203)
0.5 = coord(1/2)
0.6666667 = coord(2/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
- Source
- Journal of the American Society for Information Science. 46(1995) no.5, S.348-369
