Sciweavers

1701 search results - page 297 / 341
» Providing k-anonymity in data mining
Sort
View
ILP
2003
Springer
14 years 3 months ago
Relational IBL in Music with a New Structural Similarity Measure
It is well known that many hard tasks considered in machine learning and data mining can be solved in an rather simple and robust way with an instance- and distance-based approach....
Asmir Tobudic, Gerhard Widmer
ITNG
2010
IEEE
14 years 2 months ago
A Fast and Stable Incremental Clustering Algorithm
— Clustering is a pivotal building block in many data mining applications and in machine learning in general. Most clustering algorithms in the literature pertain to off-line (or...
Steven Young, Itamar Arel, Thomas P. Karnowski, De...
SSDBM
2010
IEEE
188views Database» more  SSDBM 2010»
14 years 2 months ago
Similarity Estimation Using Bayes Ensembles
Similarity search and data mining often rely on distance or similarity functions in order to provide meaningful results and semantically meaningful patterns. However, standard dist...
Tobias Emrich, Franz Graf, Hans-Peter Kriegel, Mat...
CIKM
2009
Springer
14 years 2 months ago
Density-based clustering using graphics processors
During the last few years, GPUs have evolved from simple devices for the display signal preparation into powerful coprocessors that do not only support typical computer graphics t...
Christian Böhm, Robert Noll, Claudia Plant, B...
DAWAK
2001
Springer
14 years 2 months ago
Adaptable Similarity Search Using Vector Quantization
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining applications, particularly for domains such as multimedia, CAD, molecular ...
Christian Böhm, Hans-Peter Kriegel, Thomas Se...