Sciweavers

1399 search results - page 119 / 280
» New Algorithms for k-Center and Extensions
Sort
View
ICML
2005
IEEE
14 years 9 months ago
Bayesian hierarchical clustering
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages ove...
Katherine A. Heller, Zoubin Ghahramani
ADC
2006
Springer
120views Database» more  ADC 2006»
14 years 3 months ago
Approximate data mining in very large relational data
In this paper we discuss eNERF, an extended version of non-Euclidean relational fuzzy c-means (NERFCM) for approximate clustering in very large (unloadable) relational data. The e...
James C. Bezdek, Richard J. Hathaway, Christopher ...
ADMA
2005
Springer
143views Data Mining» more  ADMA 2005»
14 years 2 months ago
A Comprehensive Benchmark of the Artificial Immune Recognition System (AIRS)
: Artificial Immune Systems are a new class of algorithms inspired by how the immune system recognizes, attacks and remembers intruders. This is a fascinating idea, but to be accep...
Lingjun Meng, Peter van der Putten, Haiyang Wang
ECAI
2004
Springer
14 years 2 months ago
Learning Complex and Sparse Events in Long Sequences
The Hierarchical Hidden Markov Model (HHMM) is a well formalized tool suitable to model complex patterns in long temporal or spatial sequences. Even if effective algorithms are ava...
Marco Botta, Ugo Galassi, Attilio Giordana
WABI
2004
Springer
106views Bioinformatics» more  WABI 2004»
14 years 2 months ago
Suboptimal Local Alignments Across Multiple Scoring Schemes
Abstract. Sequence alignment algorithms have a long standing tradition in bioinformatics. In this paper, we formulate an extension to existing local alignment algorithms: local ali...
Morris Michael, Christoph Dieterich, Jens Stoye