Author:
Schäfer Till,Mutzel Petra
Publisher
Springer International Publishing
Reference36 articles.
1. Ackerman, M., Ben-David, S.: Clusterability: a theoretical study. In: Proceedings of AISTATS, pp. 1–8 (2009)
2. Aggarwal, C.C., Procopiuc, C.M., Wolf, J.L., Yu, P.S., Park, J.S.: Fast algorithms for projected clustering. In: Proceedings of SIGMOD, pp. 61–72 (1999)
3. Aggarwal, C.C., Ta, N., Wang, J., Feng, J., Zaki, M.J.: XProj: a framework for projected structural clustering of XML documents. In: Proceedings of KDD, pp. 46–55 (2007)
4. Anchuri, P., Zaki, M.J., Barkol, O., Golan, S., Shamy, M.: Approximate graph mining with label costs. In: Proceedings of KDD, pp. 518–526, Chicago, Illinois, USA (2013)
5. Beyer, K.S., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is “Nearest Neighbor” meaningful? In: Proceedings of ICDT, pp. 217–235 (1999)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Effectively answering why questions on structural graph clustering;Applied Soft Computing;2024-03
2. Chemical Similarity and Substructure Searches;Reference Module in Life Sciences;2024
3. Graph-Based Methods for Rational Drug Design;Lecture Notes in Computer Science;2022
4. Adapting k-means for graph clustering;Knowledge and Information Systems;2021-12-04
5. Effectively Refining Parameters for Unexpected Nodes on Structural Graph Clustering;2020 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom);2020-12