The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Enhanced hypertext categorization using hyperlinks
Open accessAbstract
A major challenge in indexing unstructured hypertext databases is to automatically extract meta-data that enables structured search using topic taxonomies, circumvents keyword ambiguity, and improves the quality of search and profile-based routing and filtering. Therefore, an accurate classifier is an essential component of a hypertext database. Hyperlinks pose new problems not addressed in the extensive text classification literature. Links clearly contain high-quality semantic clues that are lost upon a purely term-based classifier, but exploiting link information is non-trivial because it is noisy. Naive use of terms in the link neighborhood of a document can even degrade accuracy. Our contribution is to propose robust statistical models and a relaxation labeling technique for better classification by exploiting link information in a small neighborhood around documents. Our technique also adapts gracefully to the fraction of neighboring documents having known topics. We experimented with pre-classified samples from Yahoo!1 and the US Patent Database2. In previous work, we developed a text classifier that misclassified only 13% of the documents in the well-known Reuters benchmark; this was comparable to the best results ever obtained. This classifier misclassified 36% of the patents, indicating that classifying hypertext can be more difficult than classifying text. Naively using terms in neighboring documents increased error to 38%; our hypertext classifier reduced it to 21%. Results with the Yahoo! sample were more dramatic: the text classifier showed 68% error, whereas our hypertext classifier reduced this to only 21%.
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
Classification and Regression Trees.
Gordon, A. D., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984) · Biometrics · doi:10.2307/2530946 · Cited by 23,522
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Classification And Regression Trees
Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (2017) · doi:10.1201/9781315139470 · Cited by 11,417
Introduction to Modern Information Retrieval
Salton, G., & McGill, M. J. (1983) · Virtual Defense Library (Ministerio de Defensa) · Cited by 11,392
Pattern classification and scene analysis
Chien, Y. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100577 · Cited by 3,398
Learning Logical Definitions from Relations
Quinlan, J. R. (1990) · Machine Learning · doi:10.1023/a:1022699322624 · Cited by 1,644
Pattern Classification and Scene Analysis.
Grenander, U., Duda, R. O., & Hart, P. E. (1974) · Journal of the American Statistical Association · doi:10.2307/2286028 · Cited by 1,006
On the Foundations of Relaxation Labeling Processes
Hummel, R. A., & Zucker, S. W. (1983) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1983.4767390 · Cited by 885
Automated learning of decision rules for text categorization
Apté, C., Damerau, F., & Weiss, S. M. (1994) · ACM Transactions on Information Systems · doi:10.1145/183422.183423 · Cited by 859
Hierarchically Classifying Documents Using Very Few Words
Koller, D., & Sahami, M. (1997) · Cited by 854
Cited by
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Machine learning in automated text categorization
Sebastiani, F. (2002) · ACM Computing Surveys · doi:10.1145/505282.505283 · Cited by 7,926
Statistical pattern recognition: a review
Jain, A. K., Duin, P. W., & Mao, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.824819 · Cited by 6,767
Collective Classification in Network Data
Sen, P., Namata, G., Bilgic, M., Getoor, L., Gallagher, B., & Eliassi‐Rad, T. (2008) · AI Magazine · doi:10.1609/aimag.v29i3.2157 · Cited by 3,293
Mining the network value of customers
Domingos, P., & Richardson, M. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502525 · Cited by 2,830
Richardson, M., & Domingos, P. (2006) · Machine Learning · doi:10.1007/s10994-006-5833-1 · Cited by 2,676
SimRank: a measure of structural-context similarity
Jeh, G., & Widom, J. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775126 · Cited by 1,925
The text mining handbook: advanced approaches in analyzing unstructured data
(2007) · Choice Reviews Online · doi:10.5860/choice.44-5684 · Cited by 1,598
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-citationKosala, R., & Blockeel, H. (2000) · ACM SIGKDD Explorations Newsletter · doi:10.1145/360402.360406 · Cited by 1,438
Yahoo! for Amazon: Sentiment Extraction from Small Talk on the Web
Das, S. R., & Chen, M. Y. (2007) · Management Science · doi:10.1287/mnsc.1070.0704 · Cited by 1,396
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
Getoor, L., & Diehl, C. P. (2005) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1117454.1117456 · Cited by 973
Learning to map between ontologies on the semantic web
Doan, A., Madhavan, J., Domingos, P., & Halevy, A. (2002) · Proceedings of the 11th international conference on World Wide Web · doi:10.1145/511446.511532 · Cited by 885
A Survey of Text Classification Algorithms
Aggarwal, C. C., & Zhai, C. (2012) · Mining Text Data · doi:10.1007/978-1-4614-3223-4_6 · Cited by 842
Relational learning via latent social dimensions
Tang, L., & Liu, H. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557109 · Cited by 799
“Relational learning with collective inference has been shown to outperform models that do not consider the connectivity information [4, 33, 24].”
BackgroundMethodGetoor, L. (2006) · Advanced Information and Knowledge Processing · doi:10.1007/1-84628-284-5_7 · Cited by 612
Arasu, A., Cho, J., Garcia-Molina, H., Paepcke, A., & Raghavan, S. (2001) · ACM Transactions on Internet Technology · doi:10.1145/383034.383035 · Cited by 505
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
Ontology Matching: A Machine Learning Approach
Doan, A., Madhavan, J., Domingos, P., & Halevy, A. (2004) · Handbook on Ontologies · doi:10.1007/978-3-540-24750-0_19 · Cited by 477
Learning to match ontologies on the Semantic Web
Doan, A., Madhavan, J., Dhamankar, R., Domingos, P., & Halevy, A. (2003) · The VLDB Journal The International Journal on Very Large Data Bases · doi:10.1007/s00778-003-0104-2 · Cited by 455
Classification in Networked Data: A Toolkit and a Univariate Case Study
(2007) · Journal of Machine Learning Research · doi:10.5555/1248659.1248693 · Cited by 452
Web page classification: Features and algorithms
Qi, X., & Davison, B. D. (2009) · ACM Computing Surveys · doi:10.1145/1459352.1459357 · Cited by 435
Kleinberg, J., & Tardos, É. (2002) · Journal of the ACM · doi:10.1145/585265.585268 · Cited by 400
Node Classification in Social Networks
Bhagat, S., Cormode, G., & Muthukrishnan, S. (2011) · Social Network Data Analytics · doi:10.1007/978-1-4419-8462-3_5 · Cited by 386
Leveraging social media networks for classification
Tang, L., & Liu, H. (2011) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-010-0210-x · Cited by 360
Heymann, P., Ramage, D., & Garcia-Molina, H. (2008) · Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1390334.1390425 · Cited by 311
A Study of Approaches to Hypertext Categorization
Yang, Y., Slattery, S., & Ghani, R. (2002) · Journal of Intelligent Information Systems · doi:10.1023/a:1013685612819 · Cited by 309
Data mining for hypertext: a tutorial survey
Chakrabarti, S. (2000) · ACM SIGKDD Explorations Newsletter · doi:10.1145/846183.846187 · Cited by 291
Self-citationKumar, 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
Mining newsgroups using networks arising from social behavior
Agrawal, R., Rajagopalan, S., Srikant, R., & Xu, Y. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775152.775227 · Cited by 287
Relational Dependency Networks
Neville, J., & Jensen, D. (2007) · Introduction to Statistical Relational Learning · doi:10.7551/mitpress/7432.003.0010 · Cited by 279
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
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
Combining content and link for classification using matrix factorization
Zhu, S., Yu, K., Chi, Y., & Gong, Y. (2007) · Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1277741.1277825 · Cited by 262
Why collective inference improves relational classification
Jensen, D., Neville, J., & Gallagher, B. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014125 · Cited by 256
A Simple Relational Classifier
Macskassy, S. A., & Provost, F. (2003) · doi:10.21236/ada452802 · Cited by 255
Hierarchical relational models for document networks
Chang, J., & Blei, D. M. (2010) · The Annals of Applied Statistics · doi:10.1214/09-aoas309 · Cited by 255
Social network analysis for customer churn prediction
Verbeke, W., Martens, D., & Baesens, B. (2014) · Applied Soft Computing · doi:10.1016/j.asoc.2013.09.017 · Cited by 164
Leveraging relational autocorrelation with latent group models
Neville, J., & Jensen, D. (2005) · Proceedings of the 4th international workshop on Multi-relational mining - MRDM '05 · doi:10.1145/1090193.1090201 · Cited by 121
“We propose a latent group model (LGM) for relational data, which discovers and exploits the hidden structures responsible for the observed autocorrelation among class labels.”
Topic based classification and pattern identification in patents
Venugopalan, S., & Rai, V. (2015) · Technological Forecasting and Social Change · doi:10.1016/j.techfore.2014.10.006 · Cited by 116
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
“On the other hand, at most minor improvements are Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for pro.t or commercial advantage and that copies bear this notice and the full citation on the .…”
Background
Metadata
- Authors
- Chakrabarti, S., Dom, B., & Indyk, P.
- Venue
- Proceedings of the 1998 ACM SIGMOD international conference on Management of data
- Publisher
- ACM
- Published
- 1998-06
- Pages
- 307-318
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W2076008912
- Cited by
- 769
- References
- 26
- FWCI
- 15.57
- Type
- conference paper
- 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.