loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fifth IEEE International Conference on Data Mining (ICDM'05)
A Levelwise Search Algorithm for Interesting Subspace Clusters
Houston, Texas
November 27-November 30
ISBN: 0-7695-2278-5
ASCII Text
x 
 
Haiyun Bian, Raj Bhatnagar, "A Levelwise Search Algorithm for Interesting Subspace Clusters," Data Mining, IEEE International Conference on, pp. 573-576, Fifth IEEE International Conference on Data Mining (ICDM'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/ICDM.2005.9,
author = {Haiyun Bian and Raj Bhatnagar},
title = {A Levelwise Search Algorithm for Interesting Subspace Clusters},
journal ={Data Mining, IEEE International Conference on},
volume = {0},
year = {2005},
issn = {1550-4786},
pages = {573-576},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICDM.2005.9},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Data Mining, IEEE International Conference on
TI - A Levelwise Search Algorithm for Interesting Subspace Clusters
SN - 1550-4786
SP573
EP576
A1 - Haiyun Bian,
A1 - Raj Bhatnagar,
PY - 2005
KW - null
VL - 0
JA - Data Mining, IEEE International Conference on
ER -
 
Haiyun Bian, University of Cincinnati
Raj Bhatnagar, University of Cincinnati
We present a levelwise search algorithm for finding subspace clusters in high dimensional data satisfying various properties besides the commonly used minimum density property. A set of such properties are summarized and a user can choose any of these properties. A lattice is built with all the discovered clusters which enables further analysis and discovery of useful knowledge about the clusters and their inter-relationships.
Citation:
Haiyun Bian, Raj Bhatnagar, "A Levelwise Search Algorithm for Interesting Subspace Clusters," icdm, pp.573-576, Fifth IEEE International Conference on Data Mining (ICDM'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.