Sciweavers

164 search results - page 10 / 33
» On k-Anonymity and the Curse of Dimensionality
Sort
View
AAAI
2010
14 years 11 months ago
Multi-Instance Dimensionality Reduction
Multi-instance learning deals with problems that treat bags of instances as training examples. In single-instance learning problems, dimensionality reduction is an essential step ...
Yu-Yin Sun, Michael K. Ng, Zhi-Hua Zhou
ICIP
2007
IEEE
15 years 11 months ago
Monocular Tracking 3D People By Gaussian Process Spatio-Temporal Variable Model
Tracking 3D people from monocular video is often poorly constrained. To mitigate this problem, prior knowledge should be exploited. In this paper, the Gaussian process spatio-temp...
Junbiao Pang, Laiyun Qing, Qingming Huang, Shuqian...
AAAI
2010
14 years 7 months ago
Non-I.I.D. Multi-Instance Dimensionality Reduction by Learning a Maximum Bag Margin Subspace
Multi-instance learning, as other machine learning tasks, also suffers from the curse of dimensionality. Although dimensionality reduction methods have been investigated for many ...
Wei Ping, Ye Xu, Kexin Ren, Chi-Hung Chi, Shen Fur...
81
Voted
SDM
2009
SIAM
205views Data Mining» more  SDM 2009»
15 years 6 months ago
Identifying Information-Rich Subspace Trends in High-Dimensional Data.
Identifying information-rich subsets in high-dimensional spaces and representing them as order revealing patterns (or trends) is an important and challenging research problem in m...
Chandan K. Reddy, Snehal Pokharkar
SDM
2004
SIAM
162views Data Mining» more  SDM 2004»
14 years 10 months ago
Subspace Clustering of High Dimensional Data
Clustering suffers from the curse of dimensionality, and similarity functions that use all input features with equal relevance may not be effective. We introduce an algorithm that...
Carlotta Domeniconi, Dimitris Papadopoulos, Dimitr...