Sciweavers

7049 search results - page 290 / 1410
» Data Abstraction for CSP-OZ
Sort
View
INTELLCOMM
2004
Springer
16 years 2 days ago
A Breadth-First Algorithm for Mining Frequent Patterns from Event Logs
Abstract. Today, event logs contain vast amounts of data that can easily overwhelm a human. Therefore, the mining of frequent patterns from event logs is an important system and ne...
Risto Vaarandi
PAKDD
2004
ACM
164views Data Mining» more  PAKDD 2004»
16 years 1 days ago
FP-Bonsai: The Art of Growing and Pruning Small FP-Trees
Abstract. In the context of mining frequent itemsets, numerous strategies have been proposed to push several types of constraints within the most well known algorithms. In this pap...
Francesco Bonchi, Bart Goethals
NIXDORF
1992
127views Hardware» more  NIXDORF 1992»
15 years 10 months ago
Three non Conventional Paradigms of Parallel Computation
Abstract. We consider three paradigms of computation where the bene ts of a parallel solution are greater than usual. Paradigm 1 works on a time-varying input data set, whose size ...
Fabrizio Luccio, Linda Pagli, Geppino Pucci
CAISE
2006
Springer
15 years 10 months ago
Information Sharing for the Semantic Web -a Schema Transformation Approach
Abstract. This paper proposes a framework for transforming and integrating heterogeneous XML data sources, making use of known correspondences from them to ontologies expressed in ...
Lucas Zamboulis, Alexandra Poulovassilis
DAWAK
2004
Springer
15 years 10 months ago
Space-Efficient Range-Sum Queries in OLAP
Abstract. In this paper, we present a fast algorithm to answer rangesum queries in OLAP data cubes. Our algorithm supports constanttime queries while maintaining sub-linear time up...
Fredrik Bengtsson, Jingsen Chen