Sciweavers

766 search results - page 53 / 154
» Clustering high dimensional data using subspace and projecte...
Sort
View
SBACPAD
2005
IEEE
176views Hardware» more  SBACPAD 2005»
14 years 2 months ago
Analyzing and Improving Clustering Based Sampling for Microprocessor Simulation
The time required to simulate a complete benchmark program using the cycle-accurate model of a microprocessor can be prohibitively high. One of the proposed methodologies, represe...
Yue Luo, Ajay Joshi, Aashish Phansalkar, Lizy Kuri...
CGF
2010
171views more  CGF 2010»
13 years 5 months ago
Efficient Mean-shift Clustering Using Gaussian KD-Tree
Mean shift is a popular approach for data clustering, however, the high computational complexity of the mean shift procedure limits its practical applications in high dimensional ...
Chunxia Xiao, Meng Liu
KDD
2004
ACM
624views Data Mining» more  KDD 2004»
14 years 2 months ago
Programming the K-means clustering algorithm in SQL
Using SQL has not been considered an efficient and feasible way to implement data mining algorithms. Although this is true for many data mining, machine learning and statistical a...
Carlos Ordonez
ICDE
2012
IEEE
208views Database» more  ICDE 2012»
11 years 11 months ago
Discovering Multiple Clustering Solutions: Grouping Objects in Different Views of the Data
—Traditional clustering algorithms identify just a single clustering of the data. Today’s complex data, however, allow multiple interpretations leading to several valid groupin...
Emmanuel Müller, Stephan Günnemann, Ines...
WWW
2008
ACM
14 years 9 months ago
Using subspace analysis for event detection from web click-through data
Although most of existing research usually detects events by analyzing the content or structural information of Web documents, a recent direction is to study the usage data. In th...
Ling Chen 0002, Yiqun Hu, Wolfgang Nejdl