158
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
We present an algorithm for mining tree-shaped patterns in a large graph. Novel about our class of patterns is that they can contain constants, and can contain existential nodes w...
177
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
Weblogs and message boards provide online forums for discussion that record the voice of the public. Woven into this mass of discussion is a wide range of opinion and commentary a...
188
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
Heterogeneous data co-clustering has attracted more and more attention in recent years due to its high impact on various applications. While the co-clustering algorithms for two t...
194
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
We describe an algorithm for converting linear support vector machines and any other arbitrary hyperplane-based linear classifiers into a set of non-overlapping rules that, unlike...
183
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
Development of advanced anomaly detection and failure diagnosis technologies for spacecraft is a quite significant issue in the space industry, because the space environment is ha...
199
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
180
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
207
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
The Web has been rapidly "deepened" by myriad searchable databases online, where data are hidden behind query interfaces. As an essential task toward integrating these m...