Sciweavers

885 search results - page 127 / 177
» Random Matrices in Data Analysis
Sort
View
NIPS
2004
13 years 9 months ago
Self-Tuning Spectral Clustering
We study a number of open issues in spectral clustering: (i) Selecting the appropriate scale of analysis, (ii) Handling multi-scale data, (iii) Clustering with irregular backgroun...
Lihi Zelnik-Manor, Pietro Perona
ICWN
2003
13 years 9 months ago
Modeling of WLAN Beacon Signal Strength Measured in an Indoor Environment
: In the fourth generation wireless networks, it is believed that wireless LANs (WLANs) will interwork with cellular systems to provide fast speed data services. The integration of...
Wenhui Zhang
NIPS
1998
13 years 9 months ago
A Polygonal Line Algorithm for Constructing Principal Curves
Principal curves have been defined as "self consistent" smooth curves which pass through the "middle" of a d-dimensional probability distribution or data cloud...
Balázs Kégl, Adam Krzyzak, Tam&aacut...
ITA
2006
167views Communications» more  ITA 2006»
13 years 7 months ago
Characterization of lung tumor subtypes through gene expression cluster validity assessment
The problem of assessing the reliability of clusters patients identified by clustering algorithms is crucial to estimate the significance of subclasses of diseases detectable at b...
Giorgio Valentini, Francesca Ruffino
BMCBI
2008
122views more  BMCBI 2008»
13 years 7 months ago
A practical comparison of two K-Means clustering algorithms
Background: Data clustering is a powerful technique for identifying data with similar characteristics, such as genes with similar expression patterns. However, not all implementat...
Gregory A. Wilkin, Xiuzhen Huang