Sciweavers

226 search results - page 13 / 46
» How to learn a graph from smooth signals
Sort
View
91
Voted
ICML
2004
IEEE
15 years 10 months ago
Solving cluster ensemble problems by bipartite graph partitioning
A critical problem in cluster ensemble research is how to combine multiple clusterings to yield a final superior clustering result. Leveraging advanced graph partitioning techniqu...
Xiaoli Zhang Fern, Carla E. Brodley
ICANN
2007
Springer
15 years 3 months ago
Recursive Principal Component Analysis of Graphs
Treatment of general structured information by neural networks is an emerging research topic. Here we show how representations for graphs preserving all the information can be devi...
Alessio Micheli, Alessandro Sperduti
108
Voted
CVPR
2010
IEEE
15 years 3 months ago
Putting local features on a Manifold
Local features have proven very useful for recognition. Manifold learning has proven to be a very powerful tool in data analysis. However, manifold learning application for imag...
Marwan Torki and Ahmed Elgammal
IJCNN
2000
IEEE
15 years 1 months ago
On Derivation of MLP Backpropagation from the Kelley-Bryson Optimal-Control Gradient Formula and Its Application
The well-known backpropagation (BP) derivative computation process for multilayer perceptrons (MLP) learning can be viewed as a simplified version of the Kelley-Bryson gradient f...
Eiji Mizutani, Stuart E. Dreyfus, Kenichi Nishio
70
Voted
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
15 years 4 months ago
Clustering with Multiple Graphs
—In graph-based learning models, entities are often represented as vertices in an undirected graph with weighted edges describing the relationships between entities. In many real...
Wei Tang, Zhengdong Lu, Inderjit S. Dhillon