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
SPRINT: A Scalable Parallel Classifier for Data Mining
Shafer, J. C., Agrawal, R., & Mehta, M. (1996) · Cited by 787
Inductive Logic Programming: Techniques and Applications
Lavrač, N., & Džeroski, S. (1993) · Cited by 760
SLIQ: A fast scalable classifier for data mining
Mehta, M., Agrawal, R., & Rissanen, J. (1996) · Lecture Notes in Computer Science · doi:10.1007/bfb0014141 · Cited by 749
(1990) · Cited by 671
Visually searching the Web for content
Smith, J. R., & Chang, S.-F. (1997) · IEEE Multimedia · doi:10.1109/93.621578 · Cited by 350
Markov random fields : theory and application
Chellappa, R., & Jain, A. K. (1993) · Academic Press eBooks · Cited by 265
Context-sensitive learning methods for text categorization
Cohen, W. W., & Singer, Y. (1996) · Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '96 · doi:10.1145/243199.243278 · Cited by 252
HyPursuit: a hierarchical network search engine that exploits content-link hypertext clustering
Weiss, R., Vélez, B., & Sheldon, M. A. (1996) · Proceedings of the the seventh ACM conference on Hypertext - HYPERTEXT '96 · doi:10.1145/234828.234846 · Cited by 209
Associative Document Retrieval Techniques Using Bibliographic Information
Salton, G. (1963) · Journal of the ACM · doi:10.1145/321186.321188 · Cited by 161
A retrieval model incorporating hypertext links
Croft, W. B., & Turtle, H. R. (1989) · ACM Conference on Hypertext and Social Media (HT) · doi:10.1145/74224.74242 · Cited by 149
Using Taxonomy, Discriminants, and Signatures for Navigating in Text Databases
Chakrabarti, S., Dom, B., Agrawal, R., & Raghavan, P. (1997) · Cited by 128
Self-citationUsing Probabilistic Information in Data Integration
Florescu, D., Koller, D., & Levy, A. Y. (1997) · Cited by 95
A knowledge-intensive approach to learning relational concepts
Pazzani, M. J., Brunk, C. A., & Silverstein, G. (1991) · Elsevier eBooks · doi:10.1016/b978-1-55860-200-7.50089-1 · Cited by 69
Research and development in information retrieval
(1985) · Information & Management · doi:10.1016/0378-7206(85)90069-2 · Cited by 57
Relaxation labeling of Markov random fields
Li, S. Z., Wang, H., & Petrou, M. (2002) · Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition · doi:10.1109/icpr.1994.576334 · Cited by 16
A new probabilistic scheme for information retrieval in hypertext
Savoy, J. (1995) · New Review of Hypermedia and Multimedia · doi:10.1080/13614569508914662 · Cited by 3
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
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.