Sciweavers

4820 search results - page 546 / 964
» Clustering Social Networks
Sort
View
ISCAPDCS
2007
15 years 8 months ago
A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs
With rapid increase of parallel computation systems in their sizes, it is inevitable to develop algorithms that are applicable even if there exist faulty elements in the systems. ...
Tatsuro Watanabe, Keiichi Kaneko, Shietung Peng
CORR
2010
Springer
82views Education» more  CORR 2010»
15 years 7 months ago
Expansion and Search in Networks
Borrowing from concepts in expander graphs, we study the expansion properties of real-world, complex networks (e.g. social networks, unstructured peer-to-peer or P2P networks) and...
Arun S. Maiya, Tanya Y. Berger-Wolf
IPPS
2009
IEEE
16 years 1 months ago
Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
Kamesh Madduri, David A. Bader
ICANN
2007
Springer
16 years 1 months ago
Split-Merge Incremental LEarning (SMILE) of Mixture Models
In this article we present an incremental method for building a mixture model. Given the desired number of clusters K ≥ 2, we start with a two-component mixture and we optimize t...
Konstantinos Blekas, Isaac E. Lagaris
IJCNN
2006
IEEE
16 years 26 days ago
Semi-supervised feature selection via multiobjective optimization
Abstract— In previous work, we have shown that both unsupervised feature selection and the semi-supervised clustering problem can be usefully formulated as multiobjective optimiz...
Julia Handl, Joshua D. Knowles