Abstract
While declarative programming languages are often considered to be applicable to “toy problems” only, we present an example of a real-world programming task realized with a functional programming language. CondorCKD is a novel algebraic knowledge discovery algorithm completely implemented in Haskell. We give an overview of CondorCKD and describe our experiences gained during its development, including the implementation of a graphical user interface and a novel approach to compute the cycles of an undirected graph.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beierle, C., Kern-Isberner, G.: An alternative view of knowledge discovery. In: Proceedings of the 36th Annual Hawaii International Conference on System Sciences, HICSS-36, p. 68.1. IEEE Computer Society Press, Los Alamitos (2003)
Beierle, C., Kern-Isberner, G.: Modelling conditional knowledge discovery and belief revision by abstract state machines. In: Börger, E., Gargantini, A., Riccobene, E. (eds.) ASM 2003. LNCS, vol. 2589, pp. 186–203. Springer, Heidelberg (2003)
Clare, A., King, R.D.: Data mining the yeast genome in a lazy functional language. In: Dahl, V., Wadler, P. (eds.) PADL 2003. LNCS, vol. 2562, pp. 19–26. Springer, Heidelberg (2002)
Erwig, M.: Inductive graphs and functional graph algorithms. Journal of Functional Programming 11(5), 467–492 (2001)
Gill, A.: Debugging haskell by observing intermediate data structures. Electronic Notes in Theoretical Computer Science 41(1) (2000)
Kern-Isberner, G.: Solving the inverse representation problem. In: Proceedings 14th European Conference on Artificial Intelligence, ECAI 2000, pp. 581–585. IOS Press, Amsterdam (2000)
Kern-Isberner, G., Fisseler, J.: Knowledge discovery by reversing inductive knowledge representation. In: Proceedings of the Ninth International Conference on the Principles of Knowledge Representation and Reasoning, KR-2004, pp. 34–44. AAAI Press, Menlo Park (2004)
King, D.J., Launchbury, J.: Structuring depth-first search algorithms in Haskell. In: Proceedings of the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 1995), pp. 344–354. ACM Press, New York (1995)
Leijen, D.: wxHaskell – a portable and concise GUI library for Haskell. In: ACM SIGPLAN Haskell Workshop (HW 2004). ACM Press, New York (2004)
Leijen, D., Meijer, E.: Parsec: Direct style monadic parser combinators for the real world. Technical Report UU-CS-2001-27, Department of Computer Science, Universiteit Utrecht (2001)
Mateti, P., Deo, N.: On algorithms for enumerating all circuits of a graph. SIAM Journal on Computing 5(1), 90–99 (1976)
Muggleton, S., De Raedt, L.: Inductive logic programming: Theory and methods. Journal of Logic Programming 19/20, 629–679 (1994)
Paris, J.B.: The uncertain reasoner’s companion – A mathematical perspective. Cambridge University Press, Cambridge (1994)
Runciman, C., Wakeling, D.: Heap profiling of lazy functional programs. Journal of Functional Programming 3(2), 217–245 (1993)
Witten, I.H., Frank, E.: Data Mining: Practical Machine Learning Tools and Techniques. Morgan Kaufmann, San Francisco (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fisseler, J., Kern-Isberner, G., Beierle, C., Koch, A., Müller, C. (2006). Algebraic Knowledge Discovery Using Haskell. In: Hanus, M. (eds) Practical Aspects of Declarative Languages. PADL 2007. Lecture Notes in Computer Science, vol 4354. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69611-7_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-69611-7_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69608-7
Online ISBN: 978-3-540-69611-7
eBook Packages: Computer ScienceComputer Science (R0)