Sciweavers

5046 search results - page 295 / 1010
» Non-redundant data clustering
Sort
View
SOCIALCOM
2010
15 years 4 months ago
Graph Comparison Using Fine Structure Analysis
We introduce a novel technique for comparing graphs using the structure of their subgraphs, which we call a graph's fine structure. Our technique compares graphs using the ear...
Owen Macindoe, Whitman Richards
BMCBI
2010
139views more  BMCBI 2010»
15 years 6 months ago
A highly efficient multi-core algorithm for clustering extremely large datasets
Background: In recent years, the demand for computational power in computational biology has increased due to rapidly growing data sets from microarray and other high-throughput t...
Johann M. Kraus, Hans A. Kestler
ICDE
2008
IEEE
124views Database» more  ICDE 2008»
16 years 8 months ago
Mining Approximate Order Preserving Clusters in the Presence of Noise
Subspace clustering has attracted great attention due to its capability of finding salient patterns in high dimensional data. Order preserving subspace clusters have been proven to...
Mengsheng Zhang, Wei Wang 0010, Jinze Liu
174
Voted
ICPR
2008
IEEE
16 years 1 months ago
Clustering by evidence accumulation on affinity propagation
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
Xuqing Zhang, Fei Wu, Yueting Zhuang
191
Voted
MSN
2007
Springer
161views Sensor Networks» more  MSN 2007»
16 years 26 days ago
SAPC: A Secure Aggregation Protocol for Cluster-Based Wireless Sensor Networks
To increase the lifespan of wireless sensor networks (WSN) and preserve the energy of sensors, data aggregation techniques are usually used. Aggregation can be seen as the process ...
Chakib Bekara, Maryline Laurent-Maknavicius, Kheir...