Abstract
Designing the representation languages for the input, L E, and output, L H, of a learning algorithm is the hardest task within machine learning applications. This paper emphasizes the importance of constructing an appropriate representation L E for knowledge discovery applications using the example of time related phenomena. Given the same raw data — most frequently a database with time-stamped data — rather different representations have to be produced for the learning methods that handle time. In this paper, a set of learning tasks dealing with time is given together with the input required by learning methods which solve the tasks. Transformations from raw data to the desired representation are illustrated by three case studies.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proceedings of the ACM SIGMOD Conference on Management of Data, Washington, D. C., may 1993. 11
Rakesh Agrawal, Heikki Mannila, Ramakrishnan Srikant, Hannu Toivonen, and A. Inkeri Verkamo. Fast discovery of association rules. In Usama M. Fayyad, Gregory Piatetsky-Shapiro, Padhraic Smyth, and Ramasamy Uthurusamy, editors, Advances in Knowledge Discovery and Data Mining, chapter 12, pages 307–328. AAAI Press/The MIT Press, Cambridge Massachusetts, London England, 1996. 11
Rakesh Agrawal and Ramakrishnan Srikant. Mining sequential patterns. In International Conference on Data Engineering, Taipei, Taiwan, mar 1995. 11
J. F. Allen. Towards a general theory of action and time. Artificial Intelligence, 23:123–154, 1984. 8
James F. Allen. Maintaining knowledge about temporal intervals. In R. J. Brachman and H. J. Levesque, editors, Readings in Knowledge Representation, chapter VII, pages 509–523. Morgan Kaufman, Los Altos, CA, 1985. 8
M. Bauer, U. Gather, and M. Imhoff. Analysis of high dimensional data from intensive care medicine. Technical Report 13/1998, Sonderforschungsbereich 475, Universität Dortmund, 1998. 10, 15
Francesco Bergadano and Daniele Gunetti. Inductive logic programming:from machine learning to software engineering. The MIT Press, Cambridge, Mass., 1996. 4
Pvael Brazdil. Data transformation and model selection by experimentation and meta-learning. In C. Giraud-Carrier and M. Hilario, editors, Workshop Notes — Upgrading Learning to the Meta-Level: Model Selection and Data Transformation, number CSR-98-02 in Technical Report, pages 11–17. Technical University Chemnitz, April 1998. 6
Gautam Das, King-Ip Lin, Heikki Mannila, Gopal Renganathan, and Padhraic Smyth. Rule Discovery from Time Series. In Rakesh Agrawal, Paul E. Stolorz, and Gregory Piatetsky-Shapiro, editors, Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD-98), pages 16–22, Ney York City, 1998. AAAI Press. 10, 11, 14, 16
Luc Dehaspe and Hannu Toivonen. Discovery of Frequent DATALOG Patterns. Data Mining and Knowledge Discovery, 3(1):7–36, 1999. 11
Luc DeRaedt. Interactive Theory Revision: an Inductive Logic Programming Approach. Acad. Press, London [u.a.], 1992. 4
G. Dong and S. Ginsburg. On the decomposition of chain datalog programs into p (left-)linear l-rule components. Logic Programming, 23:203–236, 1995. 11
Robert Engels. Planning tasks for knowledge discovery in databases; performing task-oriented user-guidance. In Proc. of th 2nd Int. Conf. on Knowledge Discovery in Databases, aug 1996. 6
Robert Engels, Guido Lindner, and Rudi Studer. A guided tour through the data mining jungle. In Proceedings of the 3nd International Conference on Knowledge Discovery in Databases (KDD-97), August 14–17 1997. 6
Gerald Gazdar and Chris Mellish. Natural Language Processing in PROLOG. Addison Wesley, Workingham u.a., 1989. 7
Valery Guralnik and Jaideep Srivastava. Event detection from time series data. In Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 33–42, San Diego, USA, 1999. 11
T. Joachims. Making large-scale SVM learning practical. In B. Schölkopf, C. Burges, and A. Smola, editors, Advances in Kernel Methods-Support Vector Learning, chapter 11. MIT-Press, 1999. 15
J.-U. Kietz and S. Wrobel. Controlling the complexity of learning in logic through syntactic and task-oriented models. In Stephen Muggleton, editor, Inductive Logic Programming., number 38 in The A.P.I.C. Series, chapter 16, pages 335–360. Academic Press, London [u.a.], 1992. 4
Jörg-Uwe Kietz and Marcus Lübbe. An efficient subsumption algorithm for inductive logic programming. In W. Cohen and H. Hirsh, editors, Proceedings of the 11th International Conference on Machine Learning IML-94, San Francisco, CA, 1994. Morgan Kaufmann. 5
Volker Klingspor. Reaktives Planen mit gelernten Begriffen. PhD thesis, Univ. Dortmund, 1998. 16
Volker Klingspor and Katharina Morik. Learning understandable concepts for robot navigation. In K. Morik, V. Klingspor, and M. Kaiser, editors, Making Robots Smarter — Combining Sensing and Action through Robot Learning. Kluwer, 1999. 15
S. Kramer, B. Pfahringer, and C. Helma. Stochastic propositionalization of nondeterminate background knowledge. In D. Page, editor, Procs. 8th International Workshop on Inductive Logic Programming, pages 80–94. Springer, 1998. 4
Nada Lavrač and Sašo Džeroski. Inductive Logic Programming — Techniques and Applications. Number 148 in Artificial Intelligence. Ellis Horwood, Hertfortshire, 1994. 4
H. Liu and H. Motoda. Feature Extraction, Construction, and Selection: A Data Mining Perspective. Kluwer, 1998. 5
R.S. Michalski and T.G. Dietterich. Learning to predict sequences. In R.S. Michalski, J.G. Carbonell, and T.M. Mitchell, editors, Machine Learning-An Artificial Intelligence Approach Vol II, pages 63–106. Tioga Publishing Company, Los Altos, 1986. 8
Ryszard Michalski. Inferential learning theory as a basis for multistrategy task-adaptive learning. In Michalski and Tecuci, editors, Multistrategy Learning. George Mason University, USA, 1991. 5
D. Michie, D. J. Spiegelhalter, and C. C. Taylor. Machine Learning, Neural and Statistical Classification. Ellis Horwood, New York u.a., 1994. 6
Katharina Morik. Tailoring representations to different requirements. In Osamu Watanabe and Takashi Yokomori, editors, Algorithmic Learning Theory — Procs. 10th Int. Conf. ALT99, Lecture Notes in Artificial Intelligence, pages 1–12. Springer, 1999. 15
Katharina Morik, Peter Brockhausen, and Thorsten Joachims. Combining statistical learning with a knowledge-based approach — A case study in intensive care monitoring. In Proc. 16th Int’l Conf. on Machine Learning (ICML-99), Bled, Slowenien, 1999. 15
Katharina Morik and Stephanie Wessel. Incremental signal to symbol processing. In K. Morik, M. Kaiser, and V. Klingspor, editors, Making Robots Smarter — Combining Sensing and Action through Robot Learning, chapter 11, pages 185–198. Kluwer Academic Publ., 1999. 9, 14, 16
S. Muggleton, A. Srinivasan, R. King, and M. Sternberg. Biochemical knowledge discovery using inductive logic programming. In Hiroshi Motoda, editor, Procs. First International Conference on Discovery Science. Springer, 1998. 8
Dorian Pyle. Data Preparation for Data Mining. Morgan Kaufmann Publishers, 1999. 9
Anke D. Rieger. Program Optimization for Temporal Reasoning within a Logic Programming Framework. PhD thesis, Universität Dortmund, Germany, Dortmund, FRG, 1998. 11
D. Sleeman, R. Oehlman, and R. Davidge. Specification of Consultant-0 and a Comparision of Several Learning Algorithms. Deliverable D5.1, Esprit Project P2154, 1989. 6
Devika Subramanian. A theory of justified reformulations. In D. Benjamin, Paul, editor, Change of Representation and Inductive Bias, pages 147–167. Kluwer, 1990. 4
C. Theusinger and G. Lindner. Benutzerunterstützung eines KDD-Prozesses anhand von Datencharackteristiken. In F. Wysotzki, P. Geibel, and K. Schädler, editors, Beiträge zum Treffen der GI-Fachgruppe 1.1.3 Machinelles Lernen (FGML-98), volume 98/11 of Technical Report. Technical University Berlin, 1998. 6
Vladimir N. Vapnik. The Nature of Statistical Learning Theory. Springer, New York, 1995. 4, 13
D.H. Wolpert and W.G. Macready. No free lunch theorems for search. Technical Report SFI-TR-95-02-010, Santa Fé Institute, Santa Fé, CA., 1995. 4
Stefan Wrobel. Concept Formation and Knowledge Revision. Kluwer Academic Publishers, Dordrecht, 1994. 4
Wei Zhang. A region-based approach to discovering temporal structures in data. In Ivan Bratko and Saso Dzeroski, editors, Proc. of 16th Int. Conf. on Machine Learning, pages 484–492. Morgan Kaufmann, 1999. 12
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Morik, K. (2000). The Representation Race — Preprocessing for Handling Time Phenomena. In: López de Mántaras, R., Plaza, E. (eds) Machine Learning: ECML 2000. ECML 2000. Lecture Notes in Computer Science(), vol 1810. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45164-1_2
Download citation
DOI: https://doi.org/10.1007/3-540-45164-1_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67602-7
Online ISBN: 978-3-540-45164-8
eBook Packages: Springer Book Archive