Sciweavers

927 search results - page 99 / 186
» Algorithms for Finding Gene Clusters
Sort
View
ICPR
2008
IEEE
15 years 10 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
PKDD
1999
Springer
130views Data Mining» more  PKDD 1999»
15 years 7 months ago
OPTICS-OF: Identifying Local Outliers
: For many KDD applications finding the outliers, i.e. the rare events, is more interesting and useful than finding the common cases, e.g. detecting criminal activities in E-commer...
Markus M. Breunig, Hans-Peter Kriegel, Raymond T. ...
ICML
2004
IEEE
16 years 4 months ago
A needle in a haystack: local one-class optimization
This paper addresses the problem of finding a small and coherent subset of points in a given data. This problem, sometimes referred to as one-class or set covering, requires to fi...
Koby Crammer, Gal Chechik
BMCBI
2006
166views more  BMCBI 2006»
15 years 3 months ago
Extraction of phylogenetic network modules from the metabolic network
Background: In bio-systems, genes, proteins and compounds are related to each other, thus forming complex networks. Although each organism has its individual network, some organis...
Takuji Yamada, Minoru Kanehisa, Susumu Goto
130
Voted
CIDM
2007
IEEE
15 years 10 months ago
Scalable Clustering for Large High-Dimensional Data Based on Data Summarization
Clustering large data sets with high dimensionality is a challenging data-mining task. This paper presents a framework to perform such a task efficiently. It is based on the notio...
Ying Lai, Ratko Orlandic, Wai Gen Yee, Sachin Kulk...