Sciweavers

4850 search results - page 518 / 970
» Approximate Data Structures with Applications
Sort
View
ECCV
2006
Springer
16 years 9 months ago
Learning Nonlinear Manifolds from Time Series
Abstract. There has been growing interest in developing nonlinear dimensionality reduction algorithms for vision applications. Although progress has been made in recent years, conv...
Ruei-Sung Lin, Che-Bin Liu, Ming-Hsuan Yang, Naren...
GFKL
2007
Springer
139views Data Mining» more  GFKL 2007»
16 years 1 months ago
The Noise Component in Model-based Cluster Analysis
The so-called noise-component has been introduced by Banfield and Raftery (1993) to improve the robustness of cluster analysis based on the normal mixture model. The idea is to ad...
Christian Hennig, Pietro Coretto
TNN
2008
128views more  TNN 2008»
15 years 7 months ago
Nonnegative Matrix Factorization in Polynomial Feature Space
Abstract--Plenty of methods have been proposed in order to discover latent variables (features) in data sets. Such approaches include the principal component analysis (PCA), indepe...
Ioan Buciu, Nikos Nikolaidis, Ioannis Pitas
ICMLA
2009
15 years 5 months ago
Transformation Learning Via Kernel Alignment
This article proposes an algorithm to automatically learn useful transformations of data to improve accuracy in supervised classification tasks. These transformations take the for...
Andrew Howard, Tony Jebara
342
Voted
ICDE
2007
IEEE
219views Database» more  ICDE 2007»
16 years 8 months ago
Efficient Keyword Search Across Heterogeneous Relational Databases
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...
Mayssam Sayyadian, Hieu LeKhac, AnHai Doan, Luis G...