1314 search results - page 108 / 263 » Approximate data mining in very large relational data |
ICDM
2003
IEEE
15 years 7 months ago
2003
IEEE
We propose a novel clustering algorithm that is similar in spirit to classification trees. The data is recursively split using a criterion that applies a discrete curve evolution...
137
click to vote
BMCBI
2005
15 years 1 months ago
2005
Background: Coalescent simulations are playing a large role in interpreting large scale intraspecific sequence or polymorphism surveys and for planning and evaluating association ...
119
click to vote
KDD
2001
ACM
16 years 2 months ago
2001
ACM
In this paper, we propose a general framework for distributed boosting intended for efficient integrating specialized classifiers learned over very large and distributed homogeneo...
122
click to vote
IDEAL
2000
Springer
15 years 5 months ago
2000
Springer
Factor model is a very useful and popular model in finance. In this paper, we show the relation between factor model and blind source separation, and we propose to use Independent ...
119
click to vote
KDD
2002
ACM
16 years 2 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...