.png){kind=icon}
.png){kind=icon}
Return
Partitioning-based clustering for Web document categorization
.png){kind=icon}
PRE
AI
DOI：10.1016/S0167-9236(99)00055-X.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Clustering techniques have been used by many intelligent software agents in order to retrieve, filter, and categorize documents available on the World Wide Web. Clustering is also useful in extracting salient features of related Web documents to automatically formulate queries and search for other similar documents on the Web. Traditional clustering algorithms either use a priori knowledge of document structures to define a distance or similarity among these documents, or use probabilistic techniques such as Bayesian classification. Many of these traditional algorithms, however, falter when the dimensionality of the feature space becomes high relative to the size of the document space. In this paper, we introduce two new clustering algorithms that can effectively cluster documents, even in the presence of a very high dimensional feature space. These clustering techniques, which are based on generalizations of graph partitioning, do not require pre-specified ad hoc distance functions, and are capable of automatically discovering document similarities or associations. We conduct several experiments on real Web data using various feature selection heuristics, and compare our clustering schemes to standard distance-based techniques, such as hierarchical agglomeration clustering, and Bayesian classification methods, such as AutoClass. (C) 1999 Elsevier Science B.V. All rights reserved.
Keywords:
clustering
categorization
World Wide Web documents
graph partitioning
association rules
principal component analysis
Journal
IF:
6.8
Papers:
3.8K
Citations:
1.5W
Organization
No organization information available