Discovering Structure by Learning Sparse Graphs Brenden M. Lake and Joshua B. Tenenbaum Department of Brain and Cognitive Sciences Massachusetts Institute of Technology {brenden, jbt Abstract - Princeton, Massachusetts - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2011-02-04 14:34:11 Machine learning Artificial intelligence Learning Mathematics Sparse approximation Semantic memory Regularization Supervised learning Semantic network Sparse matrix Dense graph		Discovering Structure by Learning Sparse Graphs Brenden M. Lake and Joshua B. Tenenbaum Department of Brain and Cognitive Sciences Massachusetts Institute of Technology {brenden, jbt}@mit.edu Abstract Add to Reading List Source URL: cims.nyu.edu Download Document from Source Website File Size: 653,10 KB Share Document on Facebook

	Graph Algorithms Representations of graph G with vertices V and edges E ● V x V adjacency-matrix A: Au, v = 1  (u, v) ∈ E Size: \|V\|2 Better for dense graphs, i.e., \|E\| = Ω(\|V\|2) DocID: 1v2B4 - View Document
	Noname manuscript No. (will be inserted by the editor) Subjective interestingness of subgraph patterns Matthijs van Leeuwen · Tijl De Bie · Eirini Spyropoulou · C´ DocID: 1qjb1 - View Document
	Discovering dense subgraphs and understanding their relations is important. Peeling algorithms (k-core, k-truss, and nucleus decomposition) have been shown to be effective to locate many dense subgraphs. However, constru DocID: 1qgdC - View Document
	The Publication List of Fan Chung 金芳蓉 Books: 1. Spectral Graph Theory, CBMS Lecture Series Number 92, AMS Publications, 1997, xii+207 DocID: 1pPQd - View Document
	JMLR: Workshop and Conference Proceedings vol 40:1–30, 2015 Computational Lower Bounds for Community Detection on Random Graphs Bruce Hajek DocID: 1o6Ma - View Document