Sciweavers

734 search results - page 24 / 147
» A New Indexing Method for High Dimensional Dataset
Sort
View
PKDD
2009
Springer
153views Data Mining» more  PKDD 2009»
14 years 3 months ago
Subspace Regularization: A New Semi-supervised Learning Method
Most existing semi-supervised learning methods are based on the smoothness assumption that data points in the same high density region should have the same label. This assumption, ...
Yan-Ming Zhang, Xinwen Hou, Shiming Xiang, Cheng-L...
PAKDD
2005
ACM
133views Data Mining» more  PAKDD 2005»
14 years 1 months ago
Feature Selection for High Dimensional Face Image Using Self-organizing Maps
: While feature selection is very difficult for high dimensional, unstructured data such as face image, it may be much easier to do if the data can be faithfully transformed into l...
Xiaoyang Tan, Songcan Chen, Zhi-Hua Zhou, Fuyan Zh...
JASIS
2010
182views more  JASIS 2010»
13 years 7 months ago
Understanding latent semantic indexing: A topological structure analysis using Q-analysis
Abstract – The method of latent semantic indexing (LSI) is well known for tackling the synonymy and polysemy problems in information retrieval. However, its performance can be ve...
Dandan Li, Chung-Ping Kwong
ICDM
2002
IEEE
158views Data Mining» more  ICDM 2002»
14 years 1 months ago
Adaptive dimension reduction for clustering high dimensional data
It is well-known that for high dimensional data clustering, standard algorithms such as EM and the K-means are often trapped in local minimum. Many initialization methods were pro...
Chris H. Q. Ding, Xiaofeng He, Hongyuan Zha, Horst...
SDM
2012
SIAM
452views Data Mining» more  SDM 2012»
11 years 11 months ago
Density-based Projected Clustering over High Dimensional Data Streams
Clustering of high dimensional data streams is an important problem in many application domains, a prominent example being network monitoring. Several approaches have been lately ...
Irene Ntoutsi, Arthur Zimek, Themis Palpanas, Peer...