The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Efficient phrase-based document indexing for Web document clustering
Abstract
Document clustering techniques mostly rely on single term analysis of the document data set, such as the vector space model. To achieve more accurate document clustering, more informative features including phrases and their weights are particularly important in such scenarios. Document clustering is particularly useful in many applications such as automatic categorization of documents, grouping search engine results, building a taxonomy of documents, and others. This article presents two key parts of successful document clustering. The first part is a novel phrase-based document index model, the document index graph, which allows for incremental construction of a phrase-based index of the document set with an emphasis on efficiency, rather than relying on single-term indexes only. It provides efficient phrase matching that is used to judge the similarity between documents. The model is flexible in that it could revert to a compact representation of the vector space model if we choose not to index phrases. The second part is an incremental document clustering algorithm based on maximizing the tightness of clusters by carefully watching the pair-wise document similarity distribution inside clusters. The combination of these two components creates an underlying model for robust and accurate document similarity calculation that leads to much improved results in Web document clustering over traditional methods.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
Introduction to Modern Information Retrieval
Salton, G., & McGill, M. J. (1983) · Virtual Defense Library (Ministerio de Defensa) · Cited by 9,680
An algorithm for suffix stripping
Porter, M. F. (1980) · Program · doi:10.1108/eb046814 · Cited by 8,096
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
A vector space model for automatic indexing
Salton, G., Wong, A., & Yang, C. S. (1975) · Communications of the ACM · doi:10.1145/361219.361220 · Cited by 7,521
Algorithms for clustering data
Flury, B. (1989) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(89)90033-5 · Cited by 6,432
Introduction to modern information retrieval
Dillon, M. (1983) · Information Processing & Management · doi:10.1016/0306-4573(83)90062-6 · Cited by 5,909
A Comparative Study on Feature Selection in Text Categorization
Yang, Y., & Pedersen, J. (1997) · Cited by 4,790
An Information-Theoretic Definition of Similarity
Lin, D. (1998) · Cited by 3,790
Automatic text processing: the transformation, analysis, and retrieval of information by computer
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0351 · Cited by 3,188
A Comparison of Document Clustering Techniques
Steinbach, M. S., Karypis, G., & Kumar, V. (2000) · Cited by 2,532
Information Retrieval: Data Structures and Algorithms
Frakes, W. B., & Baeza-Yates, R. A. (1992) · Cited by 2,393
Suffix Arrays: A New Method for On-Line String Searches
Manber, U., & Myers, G. (1993) · SIAM Journal on Computing · doi:10.1137/0222058 · Cited by 1,915
Nearest neighbor (NN) norms: NN pattern classification techniques
Dasarathy, B. V. (1991) · Medical Entomology and Zoology · Cited by 1,654
Inductive learning algorithms and representations for text categorization
Dumais, S., Platt, J., Heckerman, D., & Sahami, M. (1998) · Proceedings of the seventh international conference on Information and knowledge management · doi:10.1145/288627.288651 · Cited by 1,461
Kosala, R., & Blockeel, H. (2000) · ACM SIGKDD Explorations Newsletter · doi:10.1145/360402.360406 · Cited by 1,438
Web document clustering: a feasibility demonstration
Zamir, O., & Etzioni, O. (1998) · Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/290941.290956 · Cited by 1,055
Learning Information Extraction Rules for Semi-Structured and Free Text
Soderland, S. (1999) · Machine Learning · doi:10.1023/a:1007562322031 · Cited by 934
Grouper: a dynamic clustering interface to Web search results
Zamir, O., & Etzioni, O. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00054-7 · Cited by 720
Impact of Similarity Measures on Web-page Clustering
Strehl, A. L., Ghosh, J., & Mooney, R. J. (2000) · Cited by 658
Frequent term-based text clustering
Beil, F. W., Ester, M., & Xu, X. (2002) · ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/775047.775110 · Cited by 531
WEBSOM – Self-organizing maps of document collections
Kaski, S., Honkela, T., Lagus, K., & Kohonen, T. (1998) · Neurocomputing · doi:10.1016/s0925-2312(98)00039-3 · Cited by 495
Data Mining Methods for Knowledge Discovery
Cios, K. J., Pedrycz, W., & Swiniarsk, R. M. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.1998.728406 · Cited by 452
Incremental clustering and dynamic information retrieval
Charikar, M., Chekuri, C., Feder, T., & Motwani, R. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258657 · Cited by 354
Learning approaches for detecting and tracking news events
Yang, Y., Carbonell, J. G., Brown, R. D., Pierce, T., Archibald, B. T., & Liu, X. (1999) · IEEE Intelligent Systems · doi:10.1109/5254.784083 · Cited by 339
Reducing the space requirement of suffix trees
Kurtz, S. (1999) · Software: Practice and Experience · doi:10.1002/(sici)1097-024x(199911)29:13<1149::aid-spe274>3.0.co;2-o · Cited by 334
Data Mining Methods for Knowledge Discovery
Cios, K. J., Pedrycz, W., & Swiniarski, R. W. (1998) · Springer eBooks · doi:10.1007/978-1-4615-5589-6 · Cited by 315
Feature Engineering for Text Classification
Scott, S., & Matwin, S. (1999) · Cited by 307
The Myriad Virtues of Subword Trees
Apostolico, A. (1985) · Combinatorial Algorithms on Words · doi:10.1007/978-3-642-82456-2_6 · Cited by 274
Partitioning-based clustering for Web document categorization
Boley, D., Gini, M., Gross, R., Han, E.-H. (., Hastings, K., Karypis, G., Kumar, V., Mobasher, B., & Moore, J. (1999) · Decision Support Systems · doi:10.1016/s0167-9236(99)00055-x · Cited by 262
Information Extraction with HMMs and Shrinkage
Freitag, D., & McCallum, A. K. (1999) · Cited by 237
A Mutually Beneficial Integration of Data Mining and Information Extraction
Nahm, U. Y., & Mooney, R. J. (2000) · Cited by 85
Phrase-based document similarity based on an index graph model
Hammouda, K. M., & Kamel, M. S. (2003) · Proceedings · doi:10.1109/icdm.2002.1183904 · Cited by 72
Self-citationStatistical Phrases in Automated Text Categorization
Caropreso, M. F., Matwin, S., & Sebastiani, F. (2000) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 40
Cited by
Data Mining for Internet of Things: A Survey
Tsai, C.-W., Lai, C.-F., Chiang, M.-C., & Yang, L. T. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2013.103013.00206 · Cited by 620
Detecting near-duplicates for web crawling
Manku, G. S., Jain, A., & Das Sarma, A. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242592 · Cited by 617
Naseem, U., Razzak, I., Khan, S. K., & Prasad, M. (2021) · ACM Transactions on Asian and Low-Resource Language Information Processing · doi:10.1145/3434237 · Cited by 194
Metadata
- Authors
- Hammouda, K. M., & Kamel, M. S.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2004-10
- Volume
- 16
- Issue
- 10
- Pages
- 1279-1296
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2137763598
- Cited by
- 316
- References
- 34
- FWCI
- 13.90
- Type
- journal article
- Language
- en
- Open access
- closed
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.
