论文信息 - GraBaSS - Graph-based Subspace Search - 字舞流文

GraBaSS - Graph-based Subspace Search

Klemens Böhm | Walter F. Tichy | Emmanuel Müller | Hoang Vu Nguyen | Marco Neumann | Klemens Böhm | W. Tichy | H. Nguyen | Emmanuel Müller | Marco Neumann

[1] Hans-Peter Kriegel,et al. LOF: identifying density-based local outliers , 2000, SIGMOD 2000.

[2] Hans-Peter Kriegel,et al. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.

[3] Klemens Böhm,et al. HiCS: High Contrast Subspaces for Density-Based Outlier Ranking , 2012, 2012 IEEE 28th International Conference on Data Engineering.

[4] Yiyu Yao,et al. Information-Theoretic Measures for Knowledge Discovery and Data Mining , 2003 .

[5] J. Ross Quinlan,et al. C4.5: Programs for Machine Learning , 1992 .

[6] Yi Zhang,et al. Entropy-based subspace clustering for mining numerical data , 1999, KDD '99.

[7] David Eppstein,et al. Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time , 2010, Exact Complexity of NP-hard Problems.

[8] R. Bellman. Dynamic programming. , 1957, Science.