Skip to main content

An OLAM-Based Framework for Complex Knowledge Pattern Discovery in Distributed-and-Heterogeneous-Data-Sources and Cooperative Information Systems

  • Conference paper
Data Warehousing and Knowledge Discovery (DaWaK 2007)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4654))

Included in the following conference series:

Abstract

The problem of supporting advanced decision-support processes arise in many fields of real-life applications ranging from scenarios populated by distributed and heterogeneous data sources, such as conventional distributed data warehousing environments, to cooperative information systems. Here, data repositories expose very different formats, and knowledge representation schemes are very heterogeneous accordingly. As a consequence, a relevant research challenge is how to efficiently integrate, process and mine such distributed knowledge in order to make available it to end-users/applications in an integrated and summarized manner. Starting from these considerations, in this paper we propose an OLAM-based framework for complex knowledge pattern discovery, along with a formal model underlying this framework, called \({\mathcal M}ulti-Resolution ~ {\mathcal E}nsemble-based ~ Model for Advanced ~ {\mathcal K}nowledge~ {\mathcal D}iscovery ~in ~Large ~{\mathcal D}atabases~ and~ Data~ Warehouses\) \(\mathcal{MRE-KDD}\)  + ), and a reference architecture for such a framework. Another contribute of our work is represented by the proposal of KBMiner, a visual tool that supports the editing of even-complex KDD processes according to the guidelines drawn by \(\mathcal{MRE-KDD}\)  + .

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agarwal, S., et al.: On the Computation of Multidimensional Aggregates. In: VLDB, pp. 506–521 (1996)

    Google Scholar 

  2. Agrawal, R., et al.: Mining Association Rules between Sets of Items in Large Databases. In: ACM SIGMOD, pp. 207–216 (1993)

    Google Scholar 

  3. Agrawal, R., et al.: Fast Algorithms for Mining Association Rules. In: VLDB, pp. 487–499 (1994)

    Google Scholar 

  4. Chaudhuri, S., et al.: An Overview of Data Warehousing and OLAP Technology. SIGMOD Record 26(1), 65–74 (1997)

    Article  Google Scholar 

  5. Cheeseman, P., et al.: Bayesian Classification (AutoClass): Theory and Results. In: Fayyad, U., et al. (eds.) Advances in Knowledge Discovery and Data Mining, pp. 153–180. AAAI/MIT Press, Menlo Park, CA, USA (1996)

    Google Scholar 

  6. Colliat, G.: OLAP, Relational, and Multidimensional Database Systems. SIGMOD Record 25(3), 64–69 (1996)

    Article  Google Scholar 

  7. Cuzzocrea, A.: Overcoming Limitations of Approximate Query Answering in OLAP. In: IEEE IDEAS, pp. 200–209. IEEE Computer Society Press, Los Alamitos (2005)

    Google Scholar 

  8. Cuzzocrea, A.: Improving Range-Sum Query Evaluation on Data Cubes via Polynomial Approximation. Data & Knowledge Engineering 56(2), 85–121 (2006)

    Article  Google Scholar 

  9. Cuzzocrea, A., et al.: Approximate Range-Sum Query Answering on Data Cubes with Probabilistic Guarantees. Journal of Intelligent Information Systems 28(2), 161–197 (2007)

    Article  Google Scholar 

  10. Elder IV, J., et al.: A Statistical Perspective on Knowledge Discovery in Databases. In: Fayyad, U., et al. (eds.) Advances in Knowledge Discovery and Data Mining, pp. 83–115. AAAI/MIT Press, Menlo Park, CA, USA (1996)

    Google Scholar 

  11. Ester, M., et al.: Knowledge Discovery in Large Spatial Databases: Focusing Techniques for Efficient Class Identification. In: Egenhofer, M.J., Herring, J.R. (eds.) SSD 1995. LNCS, vol. 951, pp. 67–82. Springer, Heidelberg (1995)

    Google Scholar 

  12. Fang, M., et al.: Computing Iceberg Queries Efficiently. In: VLDB, pp. 299–310 (1998)

    Google Scholar 

  13. Fayyad, U., et al.: From Data Mining to Knowledge Discovery: An Overview. In: Fayyad, U., et al. (eds.) Advances in Knowledge Discovery and Data Mining, pp. 1–35. AAAI/MIT Press, Menlo Park, CA, USA (1996)

    Google Scholar 

  14. Gray, J., et al.: Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals. Data Mining and Knowledge Discovery 1(1), 29–54 (1997)

    Article  Google Scholar 

  15. Goebel, M., et al.: A Survey of Data Mining and Knowledge Discovery Software Tools. SIGKDD Explorations 1(1), 0–33 (1999)

    Google Scholar 

  16. Han, J.: OLAP Mining: An Integration of OLAP with Data Mining. In: IFIP 2.6 DS, pp. 1–9 (1997)

    Google Scholar 

  17. Han, J., et al.: Data-driven Discovery of Quantitative Rules in Relational Databases. IEEE Transactions on Knowledge and Data Engineering 5(1), 29–40 (1993)

    Article  Google Scholar 

  18. Han, J., et al.: Discovery of Multiple-Level Association Rules from Large Databases. In: VLDB, pp. 420–431 (1995)

    Google Scholar 

  19. Han, J., et al.: Exploration of the Power of Induction in Data Mining. In: Fayyad, U., et al. (eds.) Advances in Knowledge Discovery and Data Mining, pp. 399–421. AAAI/MIT Press, Menlo Park, CA, USA (1996)

    Google Scholar 

  20. Han, J., et al.: DBMiner: A System for Mining Knowledge in Large Relational Databases. In: KDD, pp. 250–255 (1996)

    Google Scholar 

  21. Han, J., et al.: Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers, San Francisco, CA, USA (2000)

    Google Scholar 

  22. Harinarayan, V., et al.: Implementing Data Cubes Efficiently. In: ACM SIGMOD, pp. 205–216 (1996)

    Google Scholar 

  23. Ho, C.-T., et al.: Range Queries in OLAP Data Cubes. In: ACM SIGMOD, pp. 73–88 (1997)

    Google Scholar 

  24. Karayannidis, N., et al.: SISYPHUS: the Implementation of a Chunk-Based Storage Manager for OLAP. Data & Knowledge Engineering 45(2), 155–180 (2003)

    Article  Google Scholar 

  25. Ng, R., et al.: Efficient and Effective Clustering Method for Spatial Data Mining. In: VLDB, pp. 144–155 (1994)

    Google Scholar 

  26. Park, J.S., et al.: An Effective Hash-based Algorithm for Mining Association Rules. In: ACM SIGMOD, pp. 175–186 (1995)

    Google Scholar 

  27. Piatetsky-Shapiro, G.: Discovery, Analysis, and Presentation of String Rules. In: Piatetsky-Shapiro, G., et al. (eds.) Knowledge Discovery in Databases, pp. 229–238. AAAI/MIT Press, Menlo Park, CA, USA (1991)

    Google Scholar 

  28. Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers, San Francisco, CA, USA (1993)

    Google Scholar 

  29. Savasere, A., et al.: An Efficient Algorithm for Mining Association Rules in Large Databases. In: VLDB, pp. 432–443 (1995)

    Google Scholar 

  30. Srikant, R., et al.: Mining Generalized Association Rules. In: VLDB, pp. 407–419 (1995)

    Google Scholar 

  31. Vitter, J.S., et al.: Approximate Computation of Multidimensional Aggregates of Sparse Data Using Wavelets. In: ACM SIGMOD, pp. 194–204 (1999)

    Google Scholar 

  32. Witten, I., et al.: Data Mining: Practical Machine Learning Tools and Techniques, 2nd edn. Morgan Kaufmann Publishers, San Francisco, CA, USA (2005)

    MATH  Google Scholar 

  33. Zhang, T., et al.: BIRCH: An Efficient Data Clustering Method for Very Large Databases. In: ACM SIGMOD, pp. 103–114 (1996)

    Google Scholar 

  34. Zhao, Y., et al.: An Array-based Algorithm for Simultaneous Multidimensional Aggregates. In: ACM SIGMOD, pp. 159–170 (1997)

    Google Scholar 

  35. Ziarko, W.: Rough Sets, Fuzzy Sets and Knowledge Discovery. Springer, New York, NY, USA (1994)

    MATH  Google Scholar 

  36. Xin, D., et al.: Answering Top-k Queries with Multi-Dimensional Selections: The Ranking Cube Approach. In: VLDB, pp. 463–475 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Il Yeal Song Johann Eder Tho Manh Nguyen

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cuzzocrea, A. (2007). An OLAM-Based Framework for Complex Knowledge Pattern Discovery in Distributed-and-Heterogeneous-Data-Sources and Cooperative Information Systems. In: Song, I.Y., Eder, J., Nguyen, T.M. (eds) Data Warehousing and Knowledge Discovery. DaWaK 2007. Lecture Notes in Computer Science, vol 4654. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74553-2_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74553-2_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74552-5

  • Online ISBN: 978-3-540-74553-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics