Sciweavers

7150 search results - page 1242 / 1430
» Graph-Based Data Mining
Sort
View
SDM
2008
SIAM
161views Data Mining» more  SDM 2008»
13 years 10 months ago
Efficient Maximum Margin Clustering via Cutting Plane Algorithm
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...
Bin Zhao, Fei Wang, Changshui Zhang
DMIN
2010
262views Data Mining» more  DMIN 2010»
13 years 7 months ago
SMO-Style Algorithms for Learning Using Privileged Information
Recently Vapnik et al. [11, 12, 13] introduced a new learning model, called Learning Using Privileged Information (LUPI). In this model, along with standard training data, the tea...
Dmitry Pechyony, Rauf Izmailov, Akshay Vashist, Vl...
ICDM
2010
IEEE
146views Data Mining» more  ICDM 2010»
13 years 7 months ago
One-Class Matrix Completion with Low-Density Factorizations
Consider a typical recommendation problem. A company has historical records of products sold to a large customer base. These records may be compactly represented as a sparse custom...
Vikas Sindhwani, Serhat Selcuk Bucak, Jianying Hu,...
ICDM
2010
IEEE
273views Data Mining» more  ICDM 2010»
13 years 7 months ago
Learning Maximum Lag for Grouped Graphical Granger Models
Temporal causal modeling has been a highly active research area in the last few decades. Temporal or time series data arises in a wide array of application domains ranging from med...
Amit Dhurandhar
USS
2010
13 years 7 months ago
P4P: Practical Large-Scale Privacy-Preserving Distributed Computation Robust against Malicious Users
In this paper we introduce a framework for privacypreserving distributed computation that is practical for many real-world applications. The framework is called Peers for Privacy ...
Yitao Duan, NetEase Youdao, John Canny, Justin Z. ...
« Prev « First page 1242 / 1430 Last » Next »