2137 search results - page 228 / 428 » Experiments on Graph Clustering Algorithms |
KDD
2006
ACM
14 years 9 months ago
2006
ACM
This paper presents a novel Second Order Cone Programming (SOCP) formulation for large scale binary classification tasks. Assuming that the class conditional densities are mixture...
DSN
2003
IEEE
14 years 2 months ago
2003
IEEE
Arbitrary faults of a single node in a time-triggered architecture (TTA) bus topology system may cause error propagation to correct nodes and may lead to inconsistent system state...
PKDD
2009
Springer
14 years 3 months ago
2009
Springer
Existing feature extraction methods explore either global statistical or local geometric information underlying the data. In this paper, we propose a general framework to learn fea...
TIP
2010
13 years 7 months ago
2010
—We present in this paper a general formulation for nonnegative data factorization, called projective nonnegative graph embedding (PNGE), which 1) explicitly decomposes the data ...
APPROX
2007
Springer
14 years 3 months ago
2007
Springer
We initiate a systematic study of eigenvectors of random graphs. Whereas much is known about eigenvalues of graphs and how they reflect properties of the underlying graph, relati...