The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Improved Algorithms for Topic Distillation in a Hyperlinked Environment
Open accessAbstract
This paper addresses the problem of topic distillation on the World Wide Web, namely, given a typ-ical user query to find quality documents related to the query topic. Connectivity analysis has been shown to be useful in identifying high quality pages within a topic specific graph of hyperlinked documents. The essence of our approach is to augment a previous connectivity anal-ysis based algorithm with content analysis. We identify three problems with the existing approach and devise al-gorithms to tackle them. The results of a user evaluation are reported that show an improvement of precision at 10 documents by at least 45 % over pure connectivity anal-ysis. 1
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Term-weighting approaches in automatic text retrieval
Salton, G., & Buckley, C. (1988) · Information Processing & Management · doi:10.1016/0306-4573(88)90021-0 · Cited by 9,740
An algorithm for suffix stripping
Porter, M. F. (1980) · Program · doi:10.1108/eb046814 · Cited by 8,096
A First Course in Stochastic Processes
(1975) · Elsevier eBooks · doi:10.1016/c2009-1-28569-8 · Cited by 3,890
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1998) · Symposium on Discrete Algorithms · doi:10.5555/314613.315045 · Cited by 1,814
Scatter/Gather: A Cluster-based Approach to Browsing Large Document Collections
Cutting, D. R., Karger, D. R., Pedersen, J. O., & Tukey, J. W. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130362 · Cited by 1,419
Scatter/Gather: a cluster-based approach to browsing large document collections
Cutting, D. R., Karger, D. R., Pedersen, J. O., & Tukey, J. W. (1992) · Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '92 · doi:10.1145/133160.133214 · Cited by 953
Automatic resource compilation by analyzing hyperlink structure and associated text
Chakrabarti, S., Dom, B., Raghavan, P., Rajagopalan, S., Gibson, D., & Kleinberg, J. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00087-7 · Cited by 697
Silk from a sow's ear: extracting usable structures from the Web
Pirolli, P., Pitkow, J., & Rao, R. (1996) · Proceedings of the SIGCHI conference on Human factors in computing systems common ground - CHI '96 · doi:10.1145/238386.238450 · Cited by 378
Larson, R. R. (1996) · Cited by 253
Cited by
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
A faster algorithm for betweenness centrality*
Brandes, U. (2001) · The Journal of Mathematical Sociology · doi:10.1080/0022250x.2001.9990249 · Cited by 4,936
Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., & Wiener, J. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00083-9 · Cited by 2,810
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1998) · Symposium on Discrete Algorithms · doi:10.5555/314613.315045 · Cited by 1,814
Rank aggregation methods for the Web
Dwork, C., Kumar, R., Naor, M., & Sivakumar, D. (2001) · Proceedings of the 10th international conference on World Wide Web · doi:10.1145/371920.372165 · Cited by 1,793
Haveliwala, T. H. (2002) · Proceedings of the 11th international conference on World Wide Web · doi:10.1145/511446.511513 · Cited by 1,567
Focused crawling: a new approach to topic-specific Web resource discovery
Chakrabarti, S., van den Berg, M., & Dom, B. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00052-3 · Cited by 1,486
Kosala, R., & Blockeel, H. (2000) · ACM SIGKDD Explorations Newsletter · doi:10.1145/360402.360406 · Cited by 1,438
Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search
Haveliwala, T. H. (2003) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2003.1208999 · Cited by 1,052
Self-organization and identification of Web communities
Flake, G. W., Lawrence, S., Giles, C. L., & Coetzee, F. M. (2002) · Computer · doi:10.1109/2.989932 · Cited by 1,018
The Web as a Graph: Measurements, Models, and Methods
Kleinberg, J. M., Kumar, R., Raghavan, P., Rajagopalan, S., & Tomkins, A. S. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48686-0_1 · Cited by 1,016
Trawling the Web for emerging cyber-communities
Kumar, R., Raghavan, P., Rajagopalan, S., & Tomkins, A. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00040-7 · Cited by 1,000
Getoor, L., & Diehl, C. P. (2005) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1117454.1117456 · Cited by 973
Langville, A., & Meyer, C. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129091 · Cited by 894
Co-authorship networks in the digital library research community
Liu, X., Bollen, J., Nelson, M. L., & Van de Sompel, H. (2005) · Information Processing & Management · doi:10.1016/j.ipm.2005.03.012 · Cited by 823
Bianchini, M., Gori, M., & Scarselli, F. (2005) · ACM Transactions on Internet Technology · doi:10.1145/1052934.1052938 · Cited by 539
Mining the Web's link structure
Chakrabarti, S., Dom, B. E., Kumar, S. R., Raghavan, P., Rajagopalan, S., Tomkins, A., Gibson, D., & Kleinberg, J. (1999) · Computer · doi:10.1109/2.781636 · Cited by 501
Finding related pages in the World Wide Web
Dean, J., & Henzinger, M. R. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00022-5 · Cited by 489
Self-citationThe stochastic approach for link-structure analysis (SALSA) and the TKC effect
Lempel, R., & Moran, S. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00034-7 · Cited by 481
A Survey on PageRank Computing
Berkhin, P. (2005) · Internet Mathematics · doi:10.1080/15427951.2005.10129098 · Cited by 474
Balmin, A., Hristidis, V., & Papakonstantinou, Y. (2004) · Proceedings 2004 VLDB Conference · doi:10.1016/b978-012088469-8.50051-6 · Cited by 452
Trust Networks on the Semantic Web
Golbeck, J., Parsia, B., & Hendler, J. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45217-1_18 · Cited by 430
A Survey of Eigenvector Methods for Web Information Retrieval
Langville, A. N., & Meyer, C. D. (2005) · SIAM Review · doi:10.1137/s0036144503424786 · Cited by 430
Using information scent to model user information needs and actions and the Web
Chi, E. H., Pirolli, P., Chen, K., & Pitkow, J. (2001) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/365024.365325 · Cited by 418
Extrapolation methods for accelerating PageRank computations
Kamvar, S. D., Haveliwala, T. H., Manning, C. D., & Golub, G. H. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775152.775190 · Cited by 407
SALSA: the stochastic approach for link-structure analysis
Lempel, R., & Moran, S. (2001) · ACM Transactions on Information Systems · doi:10.1145/382979.383041 · Cited by 362
Understanding and combating link farming in the twitter social network
Ghosh, S., Viswanath, B., Kooti, F., Sharma, N. K., Korlam, G., Benevenuto, F., Ganguly, N., & Gummadi, K. P. (2012) · Proceedings of the 21st international conference on World Wide Web · doi:10.1145/2187836.2187846 · Cited by 342
Mining significant semantic locations from GPS data
Cao, X., Cong, G., & Jensen, C. S. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1920841.1920968 · Cited by 329
Link analysis ranking: algorithms, theory, and experiments
Borodin, A., Roberts, G. O., Rosenthal, J. S., & Tsaparas, P. (2005) · ACM Transactions on Internet Technology · doi:10.1145/1052934.1052942 · Cited by 308
Data mining for hypertext: a tutorial survey
Chakrabarti, S. (2000) · ACM SIGKDD Explorations Newsletter · doi:10.1145/846183.846187 · Cited by 291
Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tompkins, A., & Upfal, E. (2000) · Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '00 · doi:10.1145/335168.335170 · Cited by 288
Stable algorithms for link analysis
Ng, A. Y., Zheng, A. X., & Jordan, M. I. (2001) · Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/383952.384003 · Cited by 286
Template detection via data mining and its applications
Bar-Yossef, Z., & Rajagopalan, S. (2002) · Proceedings of the 11th international conference on World Wide Web · doi:10.1145/511446.511522 · Cited by 271
Adaptive methods for the computation of PageRank
Kamvar, S., Haveliwala, T., & Golub, G. (2004) · Linear Algebra and its Applications · doi:10.1016/j.laa.2003.12.008 · Cited by 271
Effective site finding using link anchor information
Craswell, N., Hawking, D., & Robertson, S. (2001) · Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/383952.383999 · Cited by 269
The Importance of Prior Probabilities for Entry Page Search
Kraaij, W., Westerveld, T., & Hiemstra, D. (2002) · Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/564376.564383 · Cited by 268
Davison, B. D. (2000) · Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/345508.345597 · Cited by 264
Survey on web spam detection: principles and algorithms
Spirin, N., & Han, J. (2012) · ACM SIGKDD Explorations Newsletter · doi:10.1145/2207243.2207252 · Cited by 252
Dill, S., Kumar, R., Mccurley, K. S., Rajagopalan, S., Sivakumar, D., & Tomkins, A. (2002) · ACM Transactions on Internet Technology · doi:10.1145/572326.572328 · Cited by 197
I/O-efficient techniques for computing pagerank
Chen, Y.-Y., Gan, Q., & Suel, T. (2002) · Proceedings of the eleventh international conference on Information and knowledge management · doi:10.1145/584792.584882 · Cited by 59
SEA: Segment-enrich-annotate paradigm for adapting dialog-based content for improved accessibility
Candan, K. S., Dönderler, M. E., Hedgpeth, T., Kim, J. W., Li, Q., & Sapino, M. L. (2009) · ACM Transactions on Information Systems · doi:10.1145/1508850.1508853 · Cited by 8
Metadata
- Authors
- Bharat, K., & Henzinger, M. R.
- Venue
- ACM SIGIR Forum
- Published
- 2017-08-02
- Volume
- 51
- Issue
- 2
- Pages
- 194-201
- ISSN
- 0163-5840 (ISSN-L)
- OpenAlex
- W2079672501
- Cited by
- 676
- References
- 14
- FWCI
- 9.68
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.