Sciweavers

7200 search results - page 1127 / 1440
» Self-Organizing Data Mining
Sort
View
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
14 years 9 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
SISAP
2011
IEEE
437views Data Mining» more  SISAP 2011»
14 years 9 months ago
Succinct nearest neighbor search
In this paper we present a novel technique for nearest neighbor searching dubbed neighborhood approximation. The central idea is to divide the database into compact regions repres...
Eric Sadit Tellez, Edgar Chávez, Gonzalo Na...
ICDE
2006
IEEE
95views Database» more  ICDE 2006»
16 years 8 months ago
Learning from Aggregate Views
In this paper, we introduce a new class of data mining problems called learning from aggregate views. In contrast to the traditional problem of learning from a single table of tra...
Bee-Chung Chen, Lei Chen 0003, Raghu Ramakrishnan,...
SDM
2009
SIAM
123views Data Mining» more  SDM 2009»
16 years 3 months ago
Tracking User Mobility to Detect Suspicious Behavior.
Popularity of mobile devices is accompanied by widespread security problems, such as MAC address spoofing in wireless networks. We propose a probabilistic approach to temporal an...
Gaurav Tandon, Philip K. Chan
IDEAL
2009
Springer
16 years 1 months ago
Clustering with XCS and Agglomerative Rule Merging
Abstract. In this paper, we present a more effective approach to clustering with eXtended Classifier System (XCS) which is divided into two phases. The first phase is the XCS le...
Liangdong Shi, Yinghuan Shi, Yang Gao
« Prev « First page 1127 / 1440 Last » Next »