Skip to main content

Declarative Knowledge Extraction with Iterative User-Defined Aggregates

  • Conference paper
Flexible Query Answering Systems

Part of the book series: Advances in Soft Computing ((AINSC,volume 7))

Abstract

We present the notion of Iterative User-Defined Aggregates as an extension of the notion of user-defined aggregates in deductive databases. Such an extension provides a versative mechanism for defining complex aggregation functions, that are not definable as distributive aggregates. As a result, we show how such a mechanism can be applied to the specification of complex data mining tasks as user-defined aggregates. The resulting formalism provides a flexible way to customize, tune and reason on both the evaluation functions and the extracted knowledge.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. J-F. Boulicaut, M. Klemettinen, and H. Mannila. Querying Inductive Databases: A Case Study on the MINE RULE Operator. In Proc. 2nd European Conf. on Principles and Practice of Knowledge Discovery in Databases (PKDD98), volume 1510 of Lecture Notes in Computer Science, pages 194 - 202, 1998.

    Google Scholar 

  2. U.M. Fayyad, G. Piatesky-Shapiro, P. Smyth, and R. Uthurusamy. Advances in Knowledge Discovery and Data Mining. AAAI Press/the MIT Press, 1996.

    Google Scholar 

  3. F. Giannotti, D. Pedreschi, and C. Zaniolo. Semantics and Expressive Power of Non Deterministic Constructs for Deductive Databases. Technical Report C96-04, The CNUCE Institute, 1996. Submitted.

    Google Scholar 

  4. F. Giannotti and G. Manco. Querying Inductive Databases via Logic-Based User-Defined Aggregates. In J. Rauch and J. Zitkov, editors, Procs. of the European Conference on Principles and Practices of Knowledge Discovery in Databases, number 1704 in Lecture Notes on Artificial Intelligence, pages 125135, September 1999.

    Google Scholar 

  5. F. Giannotti and G. Manco. Making Knowledge Extraction and Reasoning Closer. In T. Terano, editor, Procs. of the Fourth Pacific-Asia Conference on Knowledge Discovery and Data Mining, number 1805 in Lecture Notes in Computer Science, April 2000.

    Google Scholar 

  6. F. Giannotti and G. Manco. Declarative Knowledge Extraction with Iterative User-Defined Aggregates. CNUCE-CNR Technical report, June 2000.

    Google Scholar 

  7. F. Giannotti, G. Manco, M. Nanni, and D. Pedreschi. Query Answering in Nondeterministic, Nonmonotonic, Logic Databases. In T. Andreasen, H. Christiansen, and H. Larsen, editors, Procs. of the Workshop on Flexible Query Answering, number 1395 in Lecture Notes on Artificial Intelligence, pages 175-187, march 1998.

    Google Scholar 

  8. F. Giannotti, G. Manco, M. Nanni, and D. Pedreschi. Nondeterministic, Non-monotonic Logic Databases. IEEE Transactions on Knowledge and Data Engineering,2000. To appear. Available at http://www.kdd.di.unipi.it.

  9. F. Giannotti, G. Manco, M. Nanni, D. Pedreschi, and F. Turini. Using Deduction for Intelligent Data Analysis. Technical Report B4-1999-02, CNUCE Institute of CNR, January 1999. A revised version is submitted to International Journal of Knowledge Discovery and Data Mining.

    Google Scholar 

  10. H. Mannila. Inductive databases and condensed representations for data mining. In International Logic Programming Symposium, pages 21 - 30, 1997.

    Google Scholar 

  11. D. Michie, D.J. Spiegelhalter, and C. Taylor. Machine Learning, Neural and Statistical Classification. Ellis Horwood, New York, 1994.

    Google Scholar 

  12. J. Mitchell. Machine Learning. McGraw-Hill, 1997.

    Google Scholar 

  13. S. Ceri R. Meo, G. Psaila. A new sql-like operator for mining association rules. In Proceedings of The Conference on Very Large Databases, pages 122 - 133, 1996.

    Google Scholar 

  14. W. Shen, K. Ong, B. Mitbander, and C. Zaniolo. Metaqueries for Data Mining. In Advances in Knowledge Discovery and Data Mining, pages 375-398. AAAI Press/The MIT Press, 1996.

    Google Scholar 

  15. H. Wang and C. Zaniolo. Using SQL to Build New Aggregates and Extenders for Object-Relational Systems. In Procs. of the International Conference on Very Large Data Bases (VLDB200), 2000. To appear.

    Google Scholar 

  16. C. Zaniolo, N. Arni, and K. Ong. Negation and Aggregates in Recursive Rules: The £DG++ Approach. In Proc. 3rd Int. Conf. on Deductive and Object-Oriented Databases (DOOD93), volume 760 of Lecture Notes in Computer Science, 1993.

    Google Scholar 

  17. C. Zaniolo and H. Wang. Logic-Based User-Defined Aggregates for the Next Generation of Database Systems. In K.R. Apt, V. Marek, M. Truszczynski, and D.S. Warren, editors, The Logic Programming Paradigm: Current Trends and Future Directions. Springer Verlag, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Giannotti, F., Manco, G. (2001). Declarative Knowledge Extraction with Iterative User-Defined Aggregates. In: Larsen, H.L., Andreasen, T., Christiansen, H., Kacprzyk, J., Zadrożny, S. (eds) Flexible Query Answering Systems. Advances in Soft Computing, vol 7. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1834-5_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-7908-1834-5_40

  • Publisher Name: Physica, Heidelberg

  • Print ISBN: 978-3-7908-1347-0

  • Online ISBN: 978-3-7908-1834-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics