The DOI matches its Crossref record; 61 of the 61 references it cites were found in a registry or an index.
Data mining for hypertext: a tutorial survey
Open accessAbstract
With over 800 million pages covering most areas of human endeavor, the World-wide Web is a fertile ground for data mining research to make a difference to the effectiveness of information search. Today, Web surfers access the Web through two dominant interfaces: clicking on hyperlinks and searching via keyword queries. This process is often tentative and unsatisfactory. Better support is needed for expressing one's information need and dealing with a search result in more structured ways than available now. Data mining and machine learning have significant roles to play towards this end.In this paper we will survey recent advances in learning and mining problems related to hypertext in general and the Web in particular. We will review the continuum of supervised to semi-supervised to unsupervised learning problems, highlight the specific challenges which distinguish data mining in the hypertext domain from data mining in the context of data warehouses, and summarize the key areas of recent and ongoing research.
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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Advances in neural information processing systems 7
Cios, K., & Shields, M. (1997) · Neurocomputing · doi:10.1016/s0925-2312(97)90018-7 · Cited by 22,059
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Indexing by latent semantic analysis
Deerwester, S., Dumais, S. T., Furnas, G. W., Landauer, T. K., & Harshman, R. (1990) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199009)41:6<391::aid-asi1>3.0.co;2-9 · Cited by 12,751
Introduction to Modern Information Retrieval
Salton, G., & McGill, M. J. (1983) · Virtual Defense Library (Ministerio de Defensa) · Cited by 11,392
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
(2017) · The SAGE Encyclopedia of Communication Research Methods · doi:10.4135/9781483381411.n575 · Cited by 6,008
A Comparative Study on Feature Selection in Text Categorization
Yang, Y., & Pedersen, J. (1997) · Cited by 4,790
Making Large-Scale SVM Learning Practical
Joachims, T. (1998) · RePEc: Research Papers in Economics · doi:10.17877/de290r-14262 · Cited by 4,411
A comparison of event models for naive bayes text classification
McCallum, A., & Nigam, K. (1998) · Cited by 3,289
On the Optimality of the Simple Bayesian Classifier under Zero-One Loss
Domingos, P., & Pazzani, M. (1997) · Machine Learning · doi:10.1023/a:1007413511361 · Cited by 3,101
Information Retrieval: Data Structures and Algorithms
Frakes, W. B., & Baeza-Yates, R. A. (1992) · Cited by 2,757
Support Vector Method for Function Approximation, Regression Estimation, and Signal Processing
Vapnik, V. N., Golowich, S. E., & Smola, A. J. (1997) · Cited by 2,757
Conceptual Structures: Information Processing in Mind and Machine
Sowa, J. F. (1983) · Virtual Defense Library (Ministerio de Defensa) · Cited by 2,735
(1998) · Cited by 2,679
Automatic subspace clustering of high dimensional data for data mining applications
Agrawal, R., Gehrke, J., Gunopulos, D., & Raghavan, P. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276314 · Cited by 2,412
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1998) · Symposium on Discrete Algorithms · doi:10.5555/314613.315045 · Cited by 1,814
Introduction to Government and Binding Theory
Haegeman, L. (1991) · Cited by 1,627
Salton, G. (1988) · Cited by 1,587
Mathematical Methods and Algorithms for Signal Processing
Moon, T. K., & Stirling, W. C. (1999) · Cited by 1,491
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
Self-citationToward optimal feature selection
Koller, D., & Sahami, M. (1996) · Cited by 1,482
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
Accessibility of information on the web
Lawrence, S., & Giles, C. L. (1999) · Nature · doi:10.1038/21987 · Cited by 1,349
Natural Language Understanding
(2021) · AI Assistants · doi:10.7551/mitpress/12761.003.0007 · Cited by 1,271
On Bias, Variance, 0/1—Loss, and the Curse-of-Dimensionality
Friedman, J. H. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009778005914 · Cited by 1,040
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
Latent semantic indexing: a probabilistic analysis
Papadimitriou, C. H., Tamaki, H., Raghavan, P., & Vempala, S. (1998) · Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/275487.275505 · Cited by 863
Hierarchically Classifying Documents Using Very Few Words
Koller, D., & Sahami, M. (1997) · Cited by 854
An Introduction to Machine Translation
Hutchins, W. J., & SOMERS, H. L. (1992) · Medical Entomology and Zoology · Cited by 791
Using Maximum Entropy for Text Classification
Nigam, K., Lafferty, J., & McCallum, A. (1999) · Cited by 781
Enhanced hypertext categorization using hyperlinks
Chakrabarti, S., Dom, B., & Indyk, P. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276332 · Cited by 769
Self-citationAutomatic 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
Self-citationImproved Algorithms for Topic Distillation in a Hyperlinked Environment
Bharat, K., & Henzinger, M. R. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130367 · Cited by 676
Bayesian Networks for Data Mining
Heckerman, D. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009730122752 · Cited by 630
Lore: a database management system for semistructured data
McHugh, J., Abiteboul, S., Goldman, R., Quass, D., & Widom, J. (1997) · ACM SIGMOD Record · doi:10.1145/262762.262770 · Cited by 576
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
Self-citationFinding 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
Improving Text Classification by Shrinkage in a Hierarchy of Classes
McCallum, A., Rosenfeld, R., Mitchell, T., & Ng, A. Y. (2022) · doi:10.1184/r1/21708647 · Cited by 471
Improved algorithms for topic distillation in a hyperlinked environment
Bharat, K., & Henzinger, M. R. (1998) · Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/290941.290972 · Cited by 444
A technique for measuring the relative size and overlap of public Web search engines
Bharat, K., & Broder, A. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00127-5 · Cited by 389
Sociological Methodology 1985.
Campbell, R. T., & Tuma, N. B. (1987) · Contemporary Sociology · doi:10.2307/2069979 · Cited by 300
The Johnson-Lindenstrauss lemma and the sphericity of some graphs
Frankl, P., & Maehara, H. (1988) · Journal of Combinatorial Theory, Series B · doi:10.1016/0095-8956(88)90043-3 · Cited by 299
ACM-SIAM Symposium on Discrete Algorithms
Clifford, R., Jalsenius, M., & Sach, B. (2015) · Symposium on Discrete Algorithms · Cited by 273
Larson, R. R. (1996) · Cited by 253
Chakrabarti, S., Dom, B., Agrawal, R., & Raghavan, P. (1998) · The VLDB Journal The International Journal on Very Large Data Bases · doi:10.1007/s007780050061 · Cited by 227
Self-citationUsing Reinforcement Learning to Spider the Web Efficiently
Rennie, J. D. M., & McCallum, A. (1999) · Cited by 212
Constant interaction-time scatter/gather browsing of very large document collections
Cutting, D. R., Karger, D. R., & Pedersen, J. O. (1993) · Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '93 · doi:10.1145/160688.160706 · Cited by 207
Hearst, M. A., & Karadi, C. A. (1997) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/258525.258582 · Cited by 193
Language As a Cognitive Process: Syntax
Winograd, T. (1982) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 192
The Connectivity Server: fast access to linkage information on the Web
Bharat, K., Broder, A., Henzinger, M., Kumar, P., & Venkatasubramanian, S. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)80047-0 · Cited by 188
A machine learning approach to building domain-specific search engines
McCallum, A., Nigam, K., Rennie, J. D. M., & Seymore, K. (1999) · Cited by 183
Natural Language Processing in Pop-11: An Introduction to Computational Linguistics
Gazdar, G., & Mellish, C. (1989) · Cited by 176
Using Taxonomy, Discriminants, and Signatures for Navigating in Text Databases
Chakrabarti, S., Dom, B., Agrawal, R., & Raghavan, P. (1997) · Very Large Data Bases · Cited by 143
Self-citationBuilding Domain-Specific Search Engines with Machine Learning Techniques
McCallum, A., Nigam, K., Rennie, J. D. M., & Seymore, K. (1999) · Cited by 130
Techniques for Disaggregating Centrality Scores in Social Networks
Mizruchi, M. S., Mariolis, P., Schwartz, M., & Mintz, B. (1986) · Sociological Methodology · doi:10.2307/270918 · Cited by 63
Natural language processing in LISP
Wood, M. M. (1990) · Science of Computer Programming · doi:10.1016/0167-6423(90)90066-m · Cited by 42
Cited by
Chen, M., Mao, S., & Liu, Y. (2014) · Mobile Networks and Applications · doi:10.1007/s11036-013-0489-0 · Cited by 2,913
Kosala, R., & Blockeel, H. (2000) · ACM SIGKDD Explorations Newsletter · doi:10.1145/360402.360406 · Cited by 1,438
Toward Scalable Systems for Big Data Analytics: A Technology Tutorial
Hu, H., Wen, Y., Chua, T.-S., & Li, X. (2014) · IEEE Access · doi:10.1109/access.2014.2332453 · Cited by 1,099
Resource description framework: metadata and its applications
Candan, K. S., Liu, H., & Suvarna, R. (2001) · ACM SIGKDD Explorations Newsletter · doi:10.1145/507533.507536 · Cited by 1,067
Data mining in soft computing framework: a survey
Mitra, S., Pal, S. K., & Mitra, P. (2002) · IEEE Transactions on Neural Networks · doi:10.1109/72.977258 · Cited by 617
Metadata
- Authors
- Chakrabarti, S.
- Venue
- ACM SIGKDD Explorations Newsletter
- Published
- 2000-01
- Volume
- 1
- Issue
- 2
- Pages
- 1-11
- ISSN
- 1931-0145 (ISSN-L)
- 1931-0153
- OpenAlex
- W2007278710
- Cited by
- 291
- References
- 61
- FWCI
- 49.09
- Type
- journal article
- Language
- en
- Open access
- bronze
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.