Sciweavers

4850 search results - page 591 / 970
» Approximate Data Structures with Applications
Sort
View
SIGMOD
2007
ACM
183views Database» more  SIGMOD 2007»
16 years 7 months ago
Report on the First International VLDB Workshop on Clean Databases (CleanDB 2006)
In this report, we provide a summary1 of the First Int'l VLDB Workshop on Clean Databases (CleanDB 2006), which took place at Seoul, Korea, on September 11, 2006, in conjunct...
Dongwon Lee, Chen Li
KDD
1999
ACM
184views Data Mining» more  KDD 1999»
15 years 11 months ago
Mining Optimized Gain Rules for Numeric Attributes
—Association rules are useful for determining correlations between attributes of a relation and have applications in the marketing, financial, and retail sectors. Furthermore, op...
Sergey Brin, Rajeev Rastogi, Kyuseok Shim
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
16 years 6 days ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
16 years 27 days ago
Razor: mining distance-constrained embedded subtrees
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...
AIIA
2005
Springer
16 years 12 days 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