Sciweavers

25 search results - page 3 / 5
» Distance- k knowledge in self-stabilizing algorithms
Sort
View
SSD
2007
Springer
243views Database» more  SSD 2007»
14 years 12 days ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
SISAP
2008
IEEE
175views Data Mining» more  SISAP 2008»
14 years 20 days ago
Anytime K-Nearest Neighbor Search for Database Applications
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
Weijia Xu, Daniel P. Miranker, Rui Mao, Smriti R. ...
ICDM
2002
IEEE
163views Data Mining» more  ICDM 2002»
13 years 11 months ago
High Performance Data Mining Using the Nearest Neighbor Join
The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such that the r...
Christian Böhm, Florian Krebs
ESWS
2008
Springer
13 years 8 months ago
Query Answering and Ontology Population: An Inductive Approach
In order to overcome the limitations of deductive logic-based approaches to deriving operational knowledge from ontologies, especially when data come from distributed sources, indu...
Claudia d'Amato, Nicola Fanizzi, Floriana Esposito
CIKM
2006
Springer
13 years 10 months ago
An integer programming approach for frequent itemset hiding
The rapid growth of transactional data brought, soon enough, into attention the need of its further exploitation. In this paper, we investigate the problem of securing sensitive k...
Aris Gkoulalas-Divanis, Vassilios S. Verykios