Sciweavers

957 search results - page 139 / 192
» From Margin to Sparsity
Sort
View
FOCS
2008
IEEE
14 years 2 months ago
Near-Optimal Sparse Recovery in the L1 Norm
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
Piotr Indyk, Milan Ruzic
IDEAS
2008
IEEE
256views Database» more  IDEAS 2008»
14 years 2 months ago
WIDS: a sensor-based online mining wireless intrusion detection system
This paper proposes WIDS, a wireless intrusion detection system, which applies data mining clustering technique to wireless network data captured through hardware sensors for purp...
Christie I. Ezeife, Maxwell Ejelike, Akshai K. Agg...
SIGIR
2005
ACM
14 years 1 months ago
Exploiting the hierarchical structure for link analysis
Link analysis algorithms have been extensively used in Web information retrieval. However, current link analysis algorithms generally work on a flat link graph, ignoring the hiera...
Gui-Rong Xue, Qiang Yang, Hua-Jun Zeng, Yong Yu, Z...
WKDD
2010
CPS
204views Data Mining» more  WKDD 2010»
14 years 1 months ago
A Scalable, Accurate Hybrid Recommender System
—Recommender systems apply machine learning techniques for filtering unseen information and can predict whether a user would like a given resource. There are three main types of...
Mustansar Ali Ghazanfar, Adam Prügel-Bennett
ICDM
2002
IEEE
122views Data Mining» more  ICDM 2002»
14 years 19 days ago
Using Category-Based Adherence to Cluster Market-Basket Data
In this paper, we devise an efficient algorithm for clustering market-basket data. Different from those of the traditional data, the features of market-basket data are known to b...
Ching-Huang Yun, Kun-Ta Chuang, Ming-Syan Chen