Sciweavers

77 search results - page 5 / 16
» Clustering for metric and non-metric distance measures
Sort
View
VTC
2006
IEEE
129views Communications» more  VTC 2006»
14 years 2 months ago
A Framework for Automatic Clustering of Parametric MIMO Channel Data Including Path Powers
— We present a solution to the problem of identifying clusters from MIMO measurement data in a data window, with a minimum of user interaction. Conventionally, visual inspection ...
Nicolai Czink, Pierluigi Cera, Jari Salo, Ernst Bo...
BMCBI
2007
130views more  BMCBI 2007»
13 years 8 months ago
A robust measure of correlation between two genes on a microarray
Background: The underlying goal of microarray experiments is to identify gene expression patterns across different experimental conditions. Genes that are contained in a particula...
Johanna S. Hardin, Aya Mitani, Leanne Hicks, Brian...
CORR
2002
Springer
95views Education» more  CORR 2002»
13 years 8 months ago
Qualitative Visualization of Distance Information
Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distance...
Jobst Heitzig
NIPS
2004
13 years 10 months ago
Triangle Fixing Algorithms for the Metric Nearness Problem
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp
CVPR
2003
IEEE
14 years 10 months ago
Many-to-Many Graph Matching via Metric Embedding
Graph matching is an important component in many object recognition algorithms. Although most graph matching algorithms seek a one-to-one correspondence between nodes, it is often...
Yakov Keselman, Ali Shokoufandeh, M. Fatih Demirci...