1403 search results - page 35 / 281 » Set cover algorithms for very large datasets |
PRL
2008
13 years 8 months ago
2008
We propose a novel hierarchical clustering algorithm for data-sets in which only pairwise distances between the points are provided. The classical Hungarian method is an efficient...
SGAI
2010
Springer
13 years 6 months ago
2010
Springer
The Prism family of algorithms induces modular classification rules which, in contrast to decision tree induction algorithms, do not necessarily fit together into a decision tree s...
DASFAA
2007
IEEE
2007
IEEE
LAPIN: Effective Sequential Pattern Mining Algorithms by Last Position Induction for Dense Databases
14 years 2 months ago
Sequential pattern mining is very important because it is the basis of many applications. Although there has been a great deal of effort on sequential pattern mining in recent year...
LREC
2010
13 years 10 months ago
2010
The paper presents the fourth, "Mondilex" edition of the MULTEXT-East language resources, a multilingual dataset for language engineering research and development, focus...
KDD
2000
ACM
14 years 1 days ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...