Identifying the Minimal Transversals of a Hypergraph and Related Problems
SIAM Journal on Computing
Data mining, hypergraph transversals, and machine learning (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficiently mining long patterns from databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Machine Learning
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals
Data Mining and Knowledge Discovery
Levelwise Search and Borders of Theories in KnowledgeDiscovery
Data Mining and Knowledge Discovery
Cubegrades: Generalizing Association Rules
Data Mining and Knowledge Discovery
Discovery-Driven Exploration of OLAP Data Cubes
EDBT '98 Proceedings of the 6th International Conference on Extending Database Technology: Advances in Database Technology
Efficiently Mining Maximal Frequent Itemsets
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Extracting semantics from data cubes using cube transversals and closures
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Mining border descriptions of emerging patterns from dataset pairs
Knowledge and Information Systems
Stream Cube: An Architecture for Multi-Dimensional Analysis of Data Streams
Distributed and Parallel Databases
Quotient cube: how to summarize the semantics of a data cube
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
The levelwise version space algorithm and its application to molecular fragment finding
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Convex cube: towards a unified structure for multidimensional databases
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Upper Borders for Emerging Cubes
DaWaK '08 Proceedings of the 10th international conference on Data Warehousing and Knowledge Discovery
Emerging Cubes: Borders, size estimations and lossless reductions
Information Systems
Exact and Approximate Sizes of Convex Datacubes
DaWaK '09 Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery
Reduced representations of Emerging Cubes for OLAP database mining
International Journal of Business Intelligence and Data Mining
Extracting semantics in OLAP databases using emerging cubes
Information Sciences: an International Journal
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
Convex cube: towards a unified structure for multidimensional databases
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Constrained Cube Lattices for Multidimensional Database Mining
International Journal of Data Warehousing and Mining
| Hi-index | 0.00 |
In various approaches, data cubes are pre-computed in order to efficiently answer Olap queries. Such cubes are also successfully used for multidimensional analysis of data streams. In this paper, we address the issue of performing cube comparisons in order to exhibit trend reversals between two cubes. Mining such trend changes provides users with a novel and specially interesting knowledge. For capturing the latter, we introduce the concept of emerging cube. Moreover, we provide a condensed representation of emerging cubes which avoids to compute two underlying cubes. Finally, we study an algorithmic way to achieve our representation using cube maximals and cube transversals.