Sciweavers

137 search results - page 19 / 28
» A Generic and Extendible Multi-Agent Data Mining Framework
Sort
View
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
15 years 9 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
ICPR
2004
IEEE
16 years 24 days ago
Jet Based Feature Classification
In this paper, we investigate to which extent the "raw" mapping of Taylor series coefficients into jet-space can be used as a "language" for describing local i...
Kim Steenstrup Pedersen, Martin Lillholm
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
16 years 3 days ago
Nonlinear adaptive distance metric learning for clustering
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
Jianhui Chen, Zheng Zhao, Jieping Ye, Huan Liu
DAGSTUHL
2007
15 years 1 months ago
Discovering Knowledge from Local Patterns with Global Constraints
It is well known that local patterns are at the core of a lot of knowledge which may be discovered from data. Nevertheless, use of local patterns is limited by their huge number an...
Bruno Crémilleux, Arnaud Soulet
IPPS
2008
IEEE
15 years 6 months ago
Providing security to the Desktop Data Grid
Volunteer Computing is becoming a new paradigm not only for the Computational Grid, but also for institutions using production-level Data Grids because of the enormous storage pot...
Jesus Luna, Michail Flouris, Manolis Marazakis, An...