Sciweavers

4791 search results - page 592 / 959
» Clustering with partial information
Sort
View
DATAMINE
1999
140views more  DATAMINE 1999»
15 years 7 months ago
A Scalable Parallel Algorithm for Self-Organizing Maps with Applications to Sparse Data Mining Problems
Abstract. We describe a scalable parallel implementation of the self organizing map (SOM) suitable for datamining applications involving clustering or segmentation against large da...
Richard D. Lawrence, George S. Almasi, Holly E. Ru...
NN
2002
Springer
226views Neural Networks» more  NN 2002»
15 years 7 months ago
Data visualisation and manifold mapping using the ViSOM
The self-organising map (SOM) has been successfully employed as a nonparametric method for dimensionality reduction and data visualisation. However, for visualisation the SOM requ...
Hujun Yin
SAC
2008
ACM
15 years 7 months ago
A clustering-based approach for discovering interesting places in trajectories
Because of the large amount of trajectory data produced by mobile devices, there is an increasing need for mechanisms to extract knowledge from this data. Most existing works have...
Andrey Tietbohl Palma, Vania Bogorny, Bart Kuijper...
TASLP
2010
126views more  TASLP 2010»
15 years 6 months ago
Modeling Music as a Dynamic Texture
—We consider representing a short temporal fragment of musical audio as a dynamic texture, a model of both the timbral and rhythmical qualities of sound, two of the important asp...
Luke Barrington, Antoni B. Chan, Gert R. G. Lanckr...
BMVC
2010
15 years 5 months ago
Learning Directional Local Pairwise Bases with Sparse Coding
Recently, sparse coding has been receiving much attention in object and scene recognition tasks because of its superiority in learning an effective codebook over k-means clusterin...
Nobuyuki Morioka, Shin'ichi Satoh