![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Markus Peters Mohammed Javeed Zaki , Markus Peters: CLICKS: Mining Subspace Clusters in Categorical Data via K-partite Maximal Cliques. ICDE 2005 : 355-356 Mohammed Javeed Zaki , Markus Peters, Ira Assent , Thomas Seidl : CLICKS: an effective algorithm for mining subspace clusters in categorical datasets. KDD 2005 : 736-742 1 [ 1 ] 2 [ 1 ] 3 [ 1 ] [ 2 ] ![]() ©2006 Association for Computing Machinery |