Sciweavers

1013 search results - page 138 / 203
» Comparisons Between Data Clustering Algorithms
Sort
View
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
13 years 10 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
Martin Nöllenburg, Markus Völker, Alexan...
ICPR
2004
IEEE
14 years 10 months ago
Model Based Object Recognition by Robust Information Fusion
Given a set of 3D model features and their 2D image, model based object recognition determines the correspondences between those features and hence computes the pose of the object...
Haifeng Chen, Ilan Shimshoni, Peter Meer
BMCBI
2005
144views more  BMCBI 2005»
13 years 9 months ago
Redefinition of Affymetrix probe sets by sequence overlap with cDNA microarray probes reduces cross-platform inconsistencies in
Background: Comparison of data produced on different microarray platforms often shows surprising discordance. It is not clear whether this discrepancy is caused by noisy data or b...
Scott L. Carter, Aron C. Eklund, Brigham H. Mecham...
ICML
2009
IEEE
14 years 10 months ago
Robust feature extraction via information theoretic learning
In this paper, we present a robust feature extraction framework based on informationtheoretic learning. Its formulated objective aims at simultaneously maximizing the Renyi's...
Xiaotong Yuan, Bao-Gang Hu
ISCC
2006
IEEE
123views Communications» more  ISCC 2006»
14 years 3 months ago
Similarity Search in a Hybrid Overlay P2P Network
P2P systems are increasingly used to discover and share various data between users. The performance of a P2P based information retrieval system is determined by the efficiency of...
Mouna Kacimi, Kokou Yétongnon