Fast Spectral Clustering Using Autoencoders and Landmarks-Reference-Cited by-同舟云学术

Fast Spectral Clustering Using Autoencoders and Landmarks

Published:2017 Issue: Volume: Page:380-388
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Banijamali Ershad,Ghodsi Ali

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-59876-5_42

Reference16 articles.

1. Chen, X., Cai, D.: Large scale spectral clustering with landmark-based representation. In: Twenty-Fifth AAAI Conference on Artificial Intelligence (2011)

2. Lecture Notes in Computer Science;A Choromanska,2013

3. Chung, F.R.: Spectral Graph Theory, vol. 92. American Mathematical Soc., Providence (1997)

4. Dhillon, I.S.: Co-clustering documents and words using bipartite spectral graph partitioning. In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 269–274. ACM (2001)

5. Farahat, A.K., Elgohary, A., Ghodsi, A., Kamel, M.S.: Greedy column subset selection for large-scale data sets. Knowl. Inf. Syst. 45(1), 1–34 (2015)

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Two-pronged feature reduction in spectral clustering with optimized landmark selection;Applied Soft Computing;2024-08

2. Laplacian-Based Dimensionality Reduction;Elements of Dimensionality Reduction and Manifold Learning;2023

3. CAEclust: A Consensus of Autoencoders Representations for Clustering;Image Processing On Line;2022-12-20

4. Open Information Extraction from Texts: Part III. Question Answering over an Automatically Constructed Knowledge Base;Scientific and Technical Information Processing;2022-12

5. Fast Communication-Efficient Spectral Clustering over Distributed Data;IEEE Transactions on Big Data;2021-03-01