1314 search results - page 2 / 263 » Approximate data mining in very large relational data |
DMKD
1997
ACM
13 years 9 months ago
1997
ACM
Partitioning a large set of objects into homogeneous clusters is a fundamental operation in data mining. The k-means algorithm is best suited for implementing this operation becau...
ISCI
1998
13 years 5 months ago
1998
This paper presents a method for updating approximations of a concept incrementally. The results can be used to implement a quasi-incremental algorithm for learning classification...
SISAP
2009
IEEE
14 years 18 hour ago
2009
IEEE
—In the demonstration we will show a system for searching by similarity and automatically classifying images in a very large dataset. The demonstrated techniques are based on the...
GFKL
2007
Springer
13 years 9 months ago
2007
Springer
In many classification applications, Support Vector Machines (SVMs) have proven to be highly performing and easy to handle classifiers with very good generalization abilities. Howe...
PAKDD
2007
ACM
13 years 11 months ago
2007
ACM
The shear volume of the results in traditional support based frequent sequential pattern mining methods has led to increasing interest in new intelligent mining methods to find mo...