Sciweavers

39 search results - page 8 / 8
» Average Bit-Complexity of Euclidean Algorithms
Sort
View
109
Voted
CEC
2010
IEEE
14 years 9 months ago
Real-coded differential crisp clustering for MRI brain image segmentation
Abstract-- In this paper, a segmentation technique of multispectral magnetic resonance image of the brain using a new differential evolution based crisp clustering is proposed. Rea...
Indrajit Saha, Ujjwal Maulik, Sanghamitra Bandyopa...
91
Voted
KDD
2004
ACM
147views Data Mining» more  KDD 2004»
15 years 5 months ago
Clustering time series from ARMA models with clipped data
Clustering time series is a problem that has applications in a wide variety of fields, and has recently attracted a large amount of research. In this paper we focus on clustering...
Anthony J. Bagnall, Gareth J. Janacek
BMCBI
2007
148views more  BMCBI 2007»
14 years 11 months ago
Evaluation of gene-expression clustering via mutual information distance measure
Background: The definition of a distance measure plays a key role in the evaluation of different clustering solutions of gene expression profiles. In this empirical study we compa...
Ido Priness, Oded Maimon, Irad E. Ben-Gal
DATAMINE
2006
176views more  DATAMINE 2006»
14 years 11 months ago
A Bit Level Representation for Time Series Data Mining with Shape Based Similarity
Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clip...
Anthony J. Bagnall, Chotirat (Ann) Ratanamahatana,...