Sciweavers

521 search results - page 42 / 105
» Coring method for clustering a graph
Sort
View
ICDM
2003
IEEE
184views Data Mining» more  ICDM 2003»
15 years 9 months ago
Analyzing High-Dimensional Data by Subspace Validity
We are proposing a novel method that makes it possible to analyze high dimensional data with arbitrary shaped projected clusters and high noise levels. At the core of our method l...
Amihood Amir, Reuven Kashi, Nathan S. Netanyahu, D...
BMCBI
2011
14 years 7 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...
DATAMINE
2006
166views more  DATAMINE 2006»
15 years 4 months ago
Accelerated EM-based clustering of large data sets
Motivated by the poor performance (linear complexity) of the EM algorithm in clustering large data sets, and inspired by the successful accelerated versions of related algorithms l...
Jakob J. Verbeek, Jan Nunnink, Nikos A. Vlassis
CONSTRAINTS
2008
95views more  CONSTRAINTS 2008»
15 years 4 months ago
Efficient Sequence Alignment with Side-Constraints by Cluster Tree Elimination
Aligning DNA and protein sequences is a core technique in molecular biology. Often, it is desirable to include partial prior knowledge and conditions in an alignment. Going beyond...
Sebastian Will, Anke Busch, Rolf Backofen
BMCBI
2005
253views more  BMCBI 2005»
15 years 4 months ago
The Use of Edge-Betweenness Clustering to Investigate Biological Function in Protein Interaction Networks
Background: This paper describes an automated method for finding clusters of interconnected proteins in protein interaction networks and retrieving protein annotations associated ...
Ruth Dunn, Frank Dudbridge, Christopher M. Sanders...