Unverified Commit 42a76380 authored by Saman Nia's avatar Saman Nia Committed by GitHub
Browse files


parent 3bbb06e0
# This project is in progress...
In this report, we try to optimize an idea which already has been presented under title Learning Deep Representations for Graph clustering (F. Tian, B. Gao, Q. Cui, E. Chen, T. Liu, 2014). The idea is described as follows: “modeling a simple method which embedding the similarity graph by deep autoencoder with sparsity penalty, then runs the K-Means algorithm on the embedding graph to obtain the clustering result”. However, although our model is based on the original idea, but the graph similarity and the loss function and the model training methods are different. We also compare our results with the two previous results based on the recent papers ( F. Tian, B. Gao, Q. Cui, E. Chen, T. Liu, 2014), (S. Cao, W. Lu, Q, Xu, 2016) on the same datasets.
![Alt text](E:/Autoencoder_Clustering/AE_Random_Factor.jpg?raw=true "Title")
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment