Sciweavers

122 search results - page 3 / 25
» Scalable and Interpretable Data Representation for High-Dime...
Sort
View
DMIN
2008
190views Data Mining» more  DMIN 2008»
14 years 12 months ago
Optimization of Self-Organizing Maps Ensemble in Prediction
The knowledge discovery process encounters the difficulties to analyze large amount of data. Indeed, some theoretical problems related to high dimensional spaces then appear and de...
Elie Prudhomme, Stéphane Lallich
ICDM
2008
IEEE
141views Data Mining» more  ICDM 2008»
15 years 4 months ago
Scalable Tensor Decompositions for Multi-aspect Data Mining
Modern applications such as Internet traffic, telecommunication records, and large-scale social networks generate massive amounts of data with multiple aspects and high dimensiona...
Tamara G. Kolda, Jimeng Sun
ICPP
2000
IEEE
15 years 2 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
ICRA
2003
IEEE
109views Robotics» more  ICRA 2003»
15 years 3 months ago
Narrative situation assessment for human-robot interaction
Abstract— In this paper we address the problem of interpreting sensory data for human-robot interaction, especially when gathered from several robots at the same time. After desc...
Björn Jensen, Roland Philippsen, Roland Siegw...
ICASSP
2011
IEEE
14 years 2 months ago
A Bayesian marked point process for object detection. Application to muse hyperspectral data
Marked point processes have received a great attention in the recent years, for their ability to extract objects in large data sets as those obtained in biological studies or hype...
Florent Chatelain, Aude Costard, Olivier J. J. Mic...