Sciweavers

2180 search results - page 288 / 436
» Algorithms for discovering bucket orders from data
Sort
View
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
15 years 4 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo
CIKM
2009
Springer
15 years 8 months ago
Efficient feature weighting methods for ranking
Feature weighting or selection is a crucial process to identify an important subset of features from a data set. Removing irrelevant or redundant features can improve the generali...
Hwanjo Yu, Jinoh Oh, Wook-Shin Han
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
15 years 6 months ago
Learning Markov Network Structure using Few Independence Tests
In this paper we present the Dynamic Grow-Shrink Inference-based Markov network learning algorithm (abbreviated DGSIMN), which improves on GSIMN, the state-ofthe-art algorithm for...
Parichey Gandhi, Facundo Bromberg, Dimitris Margar...
MCS
2007
Springer
15 years 10 months ago
Selecting Diversifying Heuristics for Cluster Ensembles
Abstract. Cluster ensembles are deemed to be better than single clustering algorithms for discovering complex or noisy structures in data. Various heuristics for constructing such ...
Stefan Todorov Hadjitodorov, Ludmila I. Kuncheva
BMCBI
2010
142views more  BMCBI 2010»
15 years 4 months ago
Classification of protein sequences by means of irredundant patterns
Background: The classification of protein sequences using string algorithms provides valuable insights for protein function prediction. Several methods, based on a variety of diff...
Matteo Comin, Davide Verzotto