Sciweavers

298 search results - page 53 / 60
» Subspace Clustering of High Dimensional Data
Sort
View
96
Voted
ICML
2007
IEEE
16 years 1 months ago
Regression on manifolds using kernel dimension reduction
We study the problem of discovering a manifold that best preserves information relevant to a nonlinear regression. Solving this problem involves extending and uniting two threads ...
Jens Nilsson, Fei Sha, Michael I. Jordan
112
Voted
IJPRAI
2008
144views more  IJPRAI 2008»
15 years 11 days ago
Unsupervised Learning of a Hierarchy of Topological Maps Using Omnidirectional Images
unsupervised construction of topological maps, which provide an abstraction of the environment in terms of visual aspects. An unsupervised clustering algorithm is used to represent...
Ales Stimec, Matjaz Jogan, Ales Leonardis
99
Voted
ISCC
2006
IEEE
123views Communications» more  ISCC 2006»
15 years 6 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
ACSC
2005
IEEE
15 years 6 months ago
The Geodesic Self-Organizing Map and Its Error Analysis
The Self-Organizing Map (SOM) is one of the popular Artificial Neural Networks which is a useful in clustering and visualizing complex high dimensional data. Conventional SOMs are...
Yingxin Wu, Masahiro Takatsuka
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
15 years 6 months ago
A multi-objective approach to discover biclusters in microarray data
The main motivation for using a multi–objective evolutionary algorithm for finding biclusters in gene expression data is motivated by the fact that when looking for biclusters ...
Federico Divina, Jesús S. Aguilar-Ruiz