Sciweavers

158 search results - page 14 / 32
» Community Learning by Graph Approximation
Sort
View
CVPR
2012
IEEE
11 years 10 months ago
Submodular dictionary learning for sparse coding
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...
Zhuolin Jiang, Guangxiao Zhang, Larry S. Davis
IJCNN
2006
IEEE
14 years 1 months ago
A Comparison between Recursive Neural Networks and Graph Neural Networks
— Recursive Neural Networks (RNNs) and Graph Neural Networks (GNNs) are two connectionist models that can directly process graphs. RNNs and GNNs exploit a similar processing fram...
Vincenzo Di Massa, Gabriele Monfardini, Lorenzo Sa...
WALCOM
2010
IEEE
221views Algorithms» more  WALCOM 2010»
13 years 6 months ago
Variants of Spreading Messages
In a distributed computing environment a faulty node could lead other nodes in the system to behave in a faulty manor. An initial set of faults could make all the nodes in the syst...
T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Ra...
ICANN
2007
Springer
14 years 1 months ago
Unbiased SVM Density Estimation with Application to Graphical Pattern Recognition
Abstract. Classification of structured data (i.e., data that are represented as graphs) is a topic of interest in the machine learning community. This paper presents a different,...
Edmondo Trentin, Ernesto Di Iorio
IEEECIT
2009
IEEE
14 years 2 months ago
Clustering of Software Systems Using New Hybrid Algorithms
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...
Ali Safari Mamaghani, Mohammad Reza Meybodi