Sciweavers

728 search results - page 24 / 146
» Mining for Empty Rectangles in Large Data Sets
Sort
View
GIS
2009
ACM
14 years 2 months ago
Constrained reverse nearest neighbor search on mobile objects
In this paper, we formalize the novel concept of Constrained Reverse k-Nearest Neighbor (CRkNN) search on mobile objects (clients) performed at a central server. The CRkNN query c...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
SDM
2009
SIAM
138views Data Mining» more  SDM 2009»
14 years 4 months ago
ShatterPlots: Fast Tools for Mining Large Graphs.
Graphs appear in several settings, like social networks, recommendation systems, computer communication networks, gene/protein biological networks, among others. A deep, recurring...
Ana Paula Appel, Andrew Tomkins, Christos Faloutso...
SDM
2011
SIAM
242views Data Mining» more  SDM 2011»
12 years 10 months ago
Fast Algorithms for Finding Extremal Sets
Identifying the extremal (minimal and maximal) sets from a collection of sets is an important subproblem in the areas of data-mining and satisfiability checking. For example, ext...
Roberto J. Bayardo, Biswanath Panda
KDD
2008
ACM
120views Data Mining» more  KDD 2008»
14 years 8 months ago
Entity categorization over large document collections
Extracting entities (such as people, movies) from documents and identifying the categories (such as painter, writer) they belong to enable structured querying and data analysis ov...
Arnd Christian König, Rares Vernica, Venkates...
KDD
1997
ACM
104views Data Mining» more  KDD 1997»
13 years 12 months ago
An Efficient Algorithm for the Incremental Updation of Association Rules in Large Databases
Efficient discover of association rules in large databases is a we 1 studied problem and several ap-1y proaches have been proposed. However, it is non trivial to maintain the asso...
Shiby Thomas, Sreenath Bodagala, Khaled Alsabti, S...