Sciweavers

10 search results - page 2 / 2
» Full regularization path for sparse principal component anal...
Sort
View
CIKM
2010
Springer
13 years 3 months ago
Decomposing background topics from keywords by principal component pursuit
Low-dimensional topic models have been proven very useful for modeling a large corpus of documents that share a relatively small number of topics. Dimensionality reduction tools s...
Kerui Min, Zhengdong Zhang, John Wright, Yi Ma
SDM
2010
SIAM
168views Data Mining» more  SDM 2010»
13 years 3 months ago
Convex Principal Feature Selection
A popular approach for dimensionality reduction and data analysis is principal component analysis (PCA). A limiting factor with PCA is that it does not inform us on which of the o...
Mahdokht Masaeli, Yan Yan, Ying Cui, Glenn Fung, J...
AAAI
2008
13 years 7 months ago
Sparse Projections over Graph
Recent study has shown that canonical algorithms such as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) can be obtained from graph based dimensionality ...
Deng Cai, Xiaofei He, Jiawei Han
ICDM
2007
IEEE
159views Data Mining» more  ICDM 2007»
13 years 8 months ago
Spectral Regression: A Unified Approach for Sparse Subspace Learning
Recently the problem of dimensionality reduction (or, subspace learning) has received a lot of interests in many fields of information processing, including data mining, informati...
Deng Cai, Xiaofei He, Jiawei Han
APWEB
2005
Springer
13 years 10 months ago
Mining Quantitative Associations in Large Database
Association Rule Mining algorithms operate on a data matrix to derive association rule, discarding the quantities of the items, which contains valuable information. In order to mak...
Chenyong Hu, Yongji Wang, Benyu Zhang, Qiang Yang,...