Sciweavers

4085 search results - page 330 / 817
» Benchmarking Data Mining Algorithms
Sort
View
SAC
2002
ACM
15 years 4 months ago
The P-tree algebra
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
Qin Ding, Maleq Khan, Amalendu Roy, William Perriz...
KDD
2009
ACM
182views Data Mining» more  KDD 2009»
16 years 5 months ago
Scalable graph clustering using stochastic flows: applications to community discovery
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...
Venu Satuluri, Srinivasan Parthasarathy
VLDB
2005
ACM
115views Database» more  VLDB 2005»
15 years 10 months ago
KLEE: A Framework for Distributed Top-k Query Algorithms
This paper addresses the efficient processing of top-k queries in wide-area distributed data repositories where the index lists for the attribute values (or text terms) of a query...
Sebastian Michel, Peter Triantafillou, Gerhard Wei...
CIKM
2006
Springer
15 years 8 months ago
Privacy preserving sequential pattern mining in distributed databases
Research in the areas of privacy preserving techniques in databases and subsequently in privacy enhancement technologies have witnessed an explosive growth-spurt in recent years. ...
Vishal Kapoor, Pascal Poncelet, François Tr...
ICNSC
2008
IEEE
15 years 11 months ago
Mining the Royal Portrait Miniature for the Art Historical Context
— the eleventh-century royal portrait miniature painting of King Gagik-Abas of Kars, Queen Goranduxt, and Princess Marem is an important image within the realm of Armenian art hi...
Steve Read, Yu Cao, Hazel Antaramian-Hofman