Sciweavers

80 search results - page 16 / 16
» O-Cluster: Scalable Clustering of Large High Dimensional Dat...
Sort
View
ICDM
2006
IEEE
89views Data Mining» more  ICDM 2006»
14 years 3 months ago
On the Lower Bound of Local Optimums in K-Means Algorithm
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...
Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung
RECOMB
2009
Springer
14 years 10 months ago
Spatial Clustering of Multivariate Genomic and Epigenomic Information
The combination of fully sequence genomes and new technologies for high density arrays and ultra-rapid sequencing enables the mapping of generegulatory and epigenetics marks on a g...
Rami Jaschek, Amos Tanay
CVPR
2007
IEEE
14 years 4 months ago
Hierarchical Structuring of Data on Manifolds
Manifold learning methods are promising data analysis tools. However, if we locate a new test sample on the manifold, we have to find its embedding by making use of the learned e...
Jun Li, Pengwei Hao
ICIP
2002
IEEE
14 years 11 months ago
Efficient video similarity measurement with video signature
The proliferation of video content on the web makes similarity detection an indispensable tool in web data management, searching, and navigation. In this paper, we propose a numbe...
Sen-Ching S. Cheung, Avideh Zakhor
ICC
2007
IEEE
124views Communications» more  ICC 2007»
14 years 4 months ago
On Achieving Maximum Network Lifetime Through Optimal Placement of Cluster-heads in Wireless Sensor Networks
—In a wireless sensor network, the network lifetime is an important issue when the size of the network is large. In order to make the network scalable, it is divided into a numbe...
Marudachalam Dhanaraj, C. Siva Ram Murthy