Welcome to the InfoSci Platform
C-Idea: A Fast Algorithm for Computing Emerging Closed Datacubes

C-Idea: A Fast Algorithm for Computing Emerging Closed Datacubes

Mickaël Martin-Nevot, Sébastien Nedjar, Lotfi Lakhal, Rosine Cicchetti
Copyright: © 2019 |Pages: 41
ISBN13: 9781522549635|ISBN10: 1522549633|ISBN13 Softcover: 9781522588139|EISBN13: 9781522549642
DOI: 10.4018/978-1-5225-4963-5.ch005
Cite Chapter Cite Chapter

MLA

Martin-Nevot, Mickaël, et al. "C-Idea: A Fast Algorithm for Computing Emerging Closed Datacubes." Utilizing Big Data Paradigms for Business Intelligence, edited by Jérôme Darmont and Sabine Loudcher, IGI Global, 2019, pp. 129-169. https://doi.org/10.4018/978-1-5225-4963-5.ch005

APA

Martin-Nevot, M., Nedjar, S., Lakhal, L., & Cicchetti, R. (2019). C-Idea: A Fast Algorithm for Computing Emerging Closed Datacubes. In J. Darmont & S. Loudcher (Eds.), Utilizing Big Data Paradigms for Business Intelligence (pp. 129-169). IGI Global. https://doi.org/10.4018/978-1-5225-4963-5.ch005

Chicago

Martin-Nevot, Mickaël, et al. "C-Idea: A Fast Algorithm for Computing Emerging Closed Datacubes." In Utilizing Big Data Paradigms for Business Intelligence, edited by Jérôme Darmont and Sabine Loudcher, 129-169. Hershey, PA: IGI Global, 2019. https://doi.org/10.4018/978-1-5225-4963-5.ch005

Export Reference

Mendeley
Favorite

Abstract

Discovering trend reversals between two data cubes provides users with novel and interesting knowledge when the real-world context fluctuates: What is new? Which trends appear or emerge? With the concept of emerging cube, the authors capture such trend reversals by enforcing an emergence constraint. In a big data context, trend reversal predictions promote a just-in-time reaction to these strategic phenomena. In addition to prediction, a business intelligence approach aids to understand observed phenomena origins. In order to exhibit them, the proposal must be as fast as possible, without redundancy but with ideally an incremental computation. Moreover, the authors propose an algorithm called C-Idea to compute reduced and lossless representations of the emerging cube by using the concept of cube closure. This approach aims to improve efficiency and scalability while preserving integration capability. The C-Idea algorithm works à la Buc and takes the specific features of emerging cubes into account. The proposals are validated by various experiments for which we measure the size of representations.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.