166
click to vote
KDD
2002
ACM
16 years 7 months ago
2002
ACM
An adaptive semi-supervised ensemble method, ASSEMBLE, is proposed that constructs classification ensembles based on both labeled and unlabeled data. ASSEMBLE alternates between a...
191
click to vote
KDD
2002
ACM
16 years 7 months ago
2002
ACM
Text clustering methods can be used to structure large sets of text or hypertext documents. The well-known methods of text clustering, however, do not really address the special p...
183
click to vote
KDD
2002
ACM
16 years 7 months ago
2002
ACM
The rapid growth of the world wide web had made the problem of topic speci c resource discovery an important one in recent years. In this problem, it is desired to nd web pages wh...
127
click to vote
KDD
2002
ACM
16 years 7 months ago
2002
ACM
In recent years, the technological advances in mapping genes have made it increasingly easy to store and use a wide variety of biological data. Such data are usually in the form o...
166
click to vote
KDD
2002
ACM
16 years 7 months ago
2002
ACM
Large 0-1 datasets arise in various applications, such as market basket analysis and information retrieval. We concentrate on the study of topic models, aiming at results which in...
192
click to vote
KDD
2002
ACM
16 years 7 months ago
2002
ACM
We introduce a new algorithm for mining sequential patterns. Our algorithm is especially efficient when the sequential patterns in the database are very long. We introduce a novel...
189
click to vote
KDD
2002
ACM
16 years 7 months ago
2002
ACM
Relational Markov models (RMMs) are a generalization of Markov models where states can be of different types, with each type described by a different set of variables. The domain ...
198
click to vote
KDD
2002
ACM
16 years 7 months ago
2002
ACM
The goal of the knowledge discovery and data mining is to extract the useful knowledge from the given data. Visualization enables us to find structures, features, patterns, and re...
