Sciweavers

5659 search results - page 8 / 1132
» Comparing Clusterings in Space
Sort
View
AVI
2008
13 years 11 months ago
Starburst: a target expansion algorithm for non-uniform target distributions
Acquiring small targets on a tablet or touch screen can be challenging. To address the problem, researchers have proposed techniques that enlarge the effective size of targets by ...
Patrick Baudisch, Alexander Zotov, Edward Cutrell,...
SDM
2007
SIAM
74views Data Mining» more  SDM 2007»
13 years 10 months ago
HACS: Heuristic Algorithm for Clustering Subsets
The term consideration set is used in marketing to refer to the set of items a customer thought about purchasing before making a choice. While consideration sets are not directly ...
Ding Yuan, W. Nick Street
IDEAL
2003
Springer
14 years 1 months ago
GMM Based on Local Fuzzy PCA for Speaker Identification
To reduce the high dimensionality required for training of feature vectors in speaker identification, we propose an efficient GMM based on local PCA with Fuzzy clustering. The prop...
JongJoo Lee, JaeYeol Rheem, Ki Yong Lee
ISPASS
2006
IEEE
14 years 2 months ago
Comparing multinomial and k-means clustering for SimPoint
SimPoint is a technique used to pick what parts of the program’s execution to simulate in order to have a complete picture of execution. SimPoint uses data clustering algorithms...
Greg Hamerly, Erez Perelman, Brad Calder
TASLP
2011
13 years 3 months ago
Time-Domain Blind Separation of Audio Sources on the Basis of a Complete ICA Decomposition of an Observation Space
—Time-domain algorithms for blind separation of audio sources can be classified as being based either on a partial or complete decomposition of an observation space. The decompo...
Zbynek Koldovský, Petr Tichavský