Sciweavers

1116 search results - page 133 / 224
» Domination Mining and Querying
Sort
View
SISAP
2008
IEEE
98views Data Mining» more  SISAP 2008»
14 years 4 months ago
On Reinsertions in M-tree
In this paper we introduce a new M-tree building method, utilizing the classic idea of forced reinsertions. In case a leaf is about to split, some distant objects are removed from...
Jakub Lokoc, Tomás Skopal
OTM
2007
Springer
14 years 4 months ago
Discovering Executable Semantic Mappings Between Ontologies
Creating executable semantic mappings is an important task for ontology-based information integration. Although it is argued that mapping tools may require interaction from humans ...
Han Qin, Dejing Dou, Paea LePendu
DOLAP
2004
ACM
14 years 3 months ago
Cardinality-based inference control in OLAP systems: an information theoretic approach
We address the inference control problem in data cubes with some data known to users through external knowledge. The goal of inference controls is to prevent exact values of sensi...
Nan Zhang 0004, Wei Zhao, Jianer Chen
CIDM
2007
IEEE
14 years 2 months ago
An Efficient Distance Calculation Method for Uncertain Objects
Recently the academic communities have paid more attention to the queries and mining on uncertain data. In the tasks such as clustering or nearest-neighbor queries, expected distan...
Lurong Xiao, Edward Hung
SISAP
2010
IEEE
149views Data Mining» more  SISAP 2010»
13 years 8 months ago
On applications of parameterized hyperplane partitioning
The efficient similarity search in metric spaces is usually based on several low-level partitioning principles, which allow filtering of non-relevant objects during the search. I...
Jakub Lokoc, Tomás Skopal