Sciweavers

2033 search results - page 97 / 407
» Ranking on Data Manifolds
Sort
View
ICCV
2011
IEEE
12 years 9 months ago
Latent Low-Rank Representation for Subspace Segmentation and Feature Extraction
Low-Rank Representation (LRR) [16, 17] is an effective method for exploring the multiple subspace structures of data. Usually, the observed data matrix itself is chosen as the dic...
Guangcan Liu, Shuicheng Yan
ICASSP
2009
IEEE
14 years 4 months ago
Active learning for semi-supervised multi-task learning
We present an algorithm for active learning (adaptive selection of training data) within the context of semi-supervised multi-task classifier design. The semi-supervised multi-ta...
Hui Li, Xuejun Liao, Lawrence Carin
IRI
2007
IEEE
14 years 4 months ago
Acronym-Expansion Recognition and Ranking on the Web
The paper presents a study on large-scale automatic extraction of acronyms and associated expansions from Web data and from the user interactions with this data through Web search...
Alpa Jain, Silviu Cucerzan, Saliha Azzam
CVPR
2012
IEEE
12 years 3 days ago
Non-negative low rank and sparse graph for semi-supervised learning
Constructing a good graph to represent data structures is critical for many important machine learning tasks such as clustering and classification. This paper proposes a novel no...
Liansheng Zhuang, Haoyuan Gao, Zhouchen Lin, Yi Ma...
TKDE
2012
270views Formal Methods» more  TKDE 2012»
12 years 2 days ago
Low-Rank Kernel Matrix Factorization for Large-Scale Evolutionary Clustering
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...
Lijun Wang, Manjeet Rege, Ming Dong, Yongsheng Din...