Sciweavers

5046 search results - page 321 / 1010
» Non-redundant data clustering
Sort
View
JNW
2007
132views more  JNW 2007»
15 years 6 months ago
Genetic Algorithm for Hierarchical Wireless Sensor Networks
— Large scale wireless sensor networks (WSNs) can be used for various pervasive and ubiquitous applications such as security, health-care, industry automation, agriculture, envir...
Sajid Hussain, Abdul Wasey Matin, Obidul Islam
WWW
2011
ACM
15 years 1 months ago
Counting triangles and the curse of the last reducer
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
Siddharth Suri, Sergei Vassilvitskii
BMCBI
2011
14 years 10 months ago
RAG: An Update to the RNA-As-Graphs Resource
Background: In 2004, we presented a web resource for stimulating the search for novel RNAs, RNA-As-Graphs (RAG), which classified, catalogued, and predicted RNA secondary structur...
Joseph A. Izzo, Namhee Kim, Shereef Elmetwaly, Tam...
ICML
2007
IEEE
16 years 7 months ago
Graph clustering with network structure indices
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
Matthew J. Rattigan, Marc Maier, David Jensen
PKDD
2009
Springer
175views Data Mining» more  PKDD 2009»
16 years 1 months ago
Latent Dirichlet Bayesian Co-Clustering
Co-clustering has emerged as an important technique for mining contingency data matrices. However, almost all existing coclustering algorithms are hard partitioning, assigning each...
Pu Wang, Carlotta Domeniconi, Kathryn B. Laskey