Wu, K.J.; Chen, M.-C.; Sun, Y.: Automatic topics discovery from hyperlinked documents (2004)
0.01
0.010829916 = product of:
0.021659832 = sum of:
0.021659832 = product of:
0.043319665 = sum of:
0.043319665 = weight(_text_:p in 2563) [ClassicSimilarity], result of:
0.043319665 = score(doc=2563,freq=2.0), product of:
0.18174732 = queryWeight, product of:
3.5955126 = idf(docFreq=3298, maxDocs=44218)
0.050548375 = queryNorm
0.23835106 = fieldWeight in 2563, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5955126 = idf(docFreq=3298, maxDocs=44218)
0.046875 = fieldNorm(doc=2563)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Topic discovery is an important means for marketing, e-Business and social science studies. As well, it can be applied to various purposes, such as identifying a group with certain properties and observing the emergence and diminishment of a certain cyber community. Previous topic discovery work (J.M. Kleinberg, Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, p. 668) requires manual judgment of usefulness of outcomes and is thus incapable of handling the explosive growth of the Internet. In this paper, we propose the Automatic Topic Discovery (ATD) method, which combines a method of base set construction, a clustering algorithm and an iterative principal eigenvector computation method to discover the topics relevant to a given query without using manual examination. Given a query, ATD returns with topics associated with the query and top representative pages for each topic. Our experiments show that the ATD method performs better than the traditional eigenvector method in terms of computation time and topic discovery quality.
