Sciweavers

80 search results - page 13 / 16
» Adaptive Distance Metric Learning for Clustering
Sort
View
ICDM
2005
IEEE
185views Data Mining» more  ICDM 2005»
15 years 3 months ago
Adaptive Product Normalization: Using Online Learning for Record Linkage in Comparison Shopping
The problem of record linkage focuses on determining whether two object descriptions refer to the same underlying entity. Addressing this problem effectively has many practical ap...
Mikhail Bilenko, Sugato Basu, Mehran Sahami
TKDE
2010
168views more  TKDE 2010»
14 years 7 months ago
Completely Lazy Learning
—Local classifiers are sometimes called lazy learners because they do not train a classifier until presented with a test sample. However, such methods are generally not complet...
Eric K. Garcia, Sergey Feldman, Maya R. Gupta, San...
CPM
2000
Springer
160views Combinatorics» more  CPM 2000»
15 years 1 months ago
Approximation Algorithms for Hamming Clustering Problems
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
ESANN
2006
14 years 11 months ago
Data topology visualization for the Self-Organizing Map
The Self-Organizing map (SOM), a powerful method for data mining and cluster extraction, is very useful for processing data of high dimensionality and complexity. Visualization met...
Kadim Tasdemir, Erzsébet Merényi
DMIN
2006
122views Data Mining» more  DMIN 2006»
14 years 11 months ago
Clustering of Bi-Dimensional and Heterogeneous Time Series: Application to Social Sciences Data
We present an application of bi-dimensional and heterogeneous time series clustering in order to resolve a Social Sciences issue. The dataset is the result of a survey involving mo...
Rémi Gaudin, Sylvaine Barbier, Nicolas Nico...