作者: Kevin Y. Yip , David W. Cheung , Michael K. Ng , Kei-Hoi Cheung
DOI: 10.1016/J.JBI.2004.05.002
关键词: Similarity (geometry) 、 Dependency (UML) 、 Cluster analysis 、 Computer science 、 User interface 、 Linear subspace 、 Data mining 、 Euclidean distance 、 Visualization 、 Domain knowledge
摘要: In microarray gene expression data, clusters may hide in subspaces. Traditional clustering algorithms that make use of similarity measurements the full input space fail to detect clusters. recent years a number have been proposed identify this kind projected clusters, but many them rely on some critical parameters whose proper values are hard for users determine. paper new algorithm dynamically adjusts its internal thresholds is proposed. It has low dependency user while allowing domain knowledge should they be available. Experimental results show capable identifying interesting from real data.