Sciweavers

82 search results - page 11 / 17
» Intersecting data to closed sets with constraints
Sort
View
BTW
2005
Springer
108views Database» more  BTW 2005»
14 years 1 months ago
Integrating the Relational Interval Tree into IBM's DB2 Universal Database Server
: User-defined data types such as intervals require specialized access methods to be efficiently searched and queried. As database implementors cannot provide appropriate index str...
Christoph Brochhaus, Jost Enderle, Achim Schlosser...
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
14 years 8 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer
GIS
2005
ACM
14 years 8 months ago
Use of rational numbers in the design of robust geometric primitives for three-dimensional spatial database systems
A necessary step in the implementation of three-dimensional spatial data types for spatial database systems and GIS is the development of robust geometric primitives. The authors ...
Brian E. Weinrich, Markus Schneider
KDID
2004
140views Database» more  KDID 2004»
13 years 9 months ago
Mining Formal Concepts with a Bounded Number of Exceptions from Transactional Data
We are designing new data mining techniques on boolean contexts to identify a priori interesting bi-sets (i.e., sets of objects or transactions associated to sets of attributes or ...
Jérémy Besson, Céline Robarde...
AIIA
2005
Springer
14 years 1 months ago
Towards Fault-Tolerant Formal Concept Analysis
Given Boolean data sets which record properties of objects, Formal Concept Analysis is a well-known approach for knowledge discovery. Recent application domains, e.g., for very lar...
Ruggero G. Pensa, Jean-François Boulicaut