1227 search results - page 161 / 246 » Approximate Kernel Clustering |
121
click to vote
ESANN
2006
14 years 11 months ago
2006
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...
IDA
2002
Springer
14 years 9 months ago
2002
Springer
Feature subset selection is important not only for the insight gained from determining relevant modeling variables but also for the improved understandability, scalability, and pos...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
ECCV
2008
Springer
15 years 12 months ago
2008
Springer
Each facial event will give rise to complex facial appearance variation. In this paper, we propose similarity features to describe the facial appearance for video-based facial even...
ICSE
2007
IEEE-ACM
15 years 10 months ago
2007
IEEE-ACM
Detecting code clones has many software engineering applications. Existing approaches either do not scale to large code bases or are not robust against minor code modifications. I...