Mannila, Heikki
Overview
Works:  57 works in 206 publications in 2 languages and 3,615 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Author, Editor, Other 
Publication Timeline
.
Most widely held works by
Heikki Mannila
Principles of data mining by
D. J Hand(
Book
)
22 editions published between 2001 and 2012 in English and Spanish and held by 1,065 WorldCat member libraries worldwide
Topics include the role of metadata, how to handle missing data, and data preprocessing."Jacket
22 editions published between 2001 and 2012 in English and Spanish and held by 1,065 WorldCat member libraries worldwide
Topics include the role of metadata, how to handle missing data, and data preprocessing."Jacket
Constraintbased mining and inductive databases : European Workshop on Inductive Databases and Constraint Based Mining, Hinterzarten,
Germany, March 1113, 2004 : revised selected papers by
JeanFrançois Boulicaut(
)
21 editions published between 2005 and 2006 in English and Undetermined and held by 598 WorldCat member libraries worldwide
The interconnected ideas of inductive databases and constraintbased mining are appealing and have the potential to radically change the theory and practice of data mining and knowledge discovery. This book reports on the results of the European IST project "cInQ" (consortium on knowledge discovery by Inductive Queries) and its final workshop entitled ConstraintBased Mining and Inductive Databases organized in Hinterzarten, Germany in March 2004. The 18 articles in this stateoftheart survey present the latest results in inductive querying and constraintbased data mining and also identify future directions of this newly emerging field lying at the intersection of data mining and database research. The papers address topical sections on foundations of inductive database frameworks, optimizing inductive queries on local patterns, optimizing inductive queries on global patterns, and applications of inductive querying techniques
21 editions published between 2005 and 2006 in English and Undetermined and held by 598 WorldCat member libraries worldwide
The interconnected ideas of inductive databases and constraintbased mining are appealing and have the potential to radically change the theory and practice of data mining and knowledge discovery. This book reports on the results of the European IST project "cInQ" (consortium on knowledge discovery by Inductive Queries) and its final workshop entitled ConstraintBased Mining and Inductive Databases organized in Hinterzarten, Germany in March 2004. The 18 articles in this stateoftheart survey present the latest results in inductive querying and constraintbased data mining and also identify future directions of this newly emerging field lying at the intersection of data mining and database research. The papers address topical sections on foundations of inductive database frameworks, optimizing inductive queries on local patterns, optimizing inductive queries on global patterns, and applications of inductive querying techniques
Algorithms and applications : essay dedicated to Esko Ukkonen on the occasion of his 60th birthday by
Tapio Elomaa(
)
9 editions published in 2010 in English and held by 440 WorldCat member libraries worldwide
For many years Esko Ukkonen has played a major role in the advancement of computer science in Finland. He was the key person in the development of the school of algorithmic research and has contributed considerably to postgraduate education in his country. Esko Ukkonen has over the years worked within many areas of computer science, including numerical methods, complexity theory, theoretical aspects of compiler construction, and logic programming. However, the main focus of his research has been on algorithms and their applications. This Festschrift volume, published to honor Esko Ukkonen on his 60th birthday, includes 18 refereed contributions by his former PhD students and colleagues, with whom he has cooperated closely during the course of his career. The Festschrift was presented to Esko during a festive symposium organized at the University of Helsinki to celebrate his birthday. The essays primarily present research on computational pattern matching and string algorithms, two areas that have benefited significantly from the work of Esko Ukonen
9 editions published in 2010 in English and held by 440 WorldCat member libraries worldwide
For many years Esko Ukkonen has played a major role in the advancement of computer science in Finland. He was the key person in the development of the school of algorithmic research and has contributed considerably to postgraduate education in his country. Esko Ukkonen has over the years worked within many areas of computer science, including numerical methods, complexity theory, theoretical aspects of compiler construction, and logic programming. However, the main focus of his research has been on algorithms and their applications. This Festschrift volume, published to honor Esko Ukkonen on his 60th birthday, includes 18 refereed contributions by his former PhD students and colleagues, with whom he has cooperated closely during the course of his career. The Festschrift was presented to Esko during a festive symposium organized at the University of Helsinki to celebrate his birthday. The essays primarily present research on computational pattern matching and string algorithms, two areas that have benefited significantly from the work of Esko Ukonen
Discovery science : 14th international conference, DS 2011, Espoo, Finland, October 57, 2011 ; proceedings by
Tapio Elomaa(
)
14 editions published in 2011 in English and held by 428 WorldCat member libraries worldwide
Annotation
14 editions published in 2011 in English and held by 428 WorldCat member libraries worldwide
Annotation
Principles of data mining and knowledge discovery : 6th European Conference, PKDD 2002, Helsinki, Finland, August 1923, 2002
: proceedings by
Tapio Elomaa(
Book
)
19 editions published in 2002 in English and held by 349 WorldCat member libraries worldwide
Annotation
19 editions published in 2002 in English and held by 349 WorldCat member libraries worldwide
Annotation
Machine learning : ECML 2002 : 13th European Conference on Machine Learning, Helsinki, Finland, August 1923, 2002 : proceedings by
Tapio Elomaa(
Book
)
17 editions published in 2002 in English and held by 310 WorldCat member libraries worldwide
This book constitutes the refereed preceedings of the 13th European Conference on Machine Learning, ECML 2002, held in Helsinki, Finland in August 2002. The 41 revised full papers presented together with 4 invited contributions were carefully reviewed and selected from numerous submissions. Among the topics covered are computational discovery, search strategies, Classification, support vector machines, kernel methods, rule induction, linear learning, decision tree learning, boosting, collaborative learning, statistical learning, clustering, instancebased learning, reinforcement learning, multiagent learning, multirelational learning, Markov decision processes, active learning, etc
17 editions published in 2002 in English and held by 310 WorldCat member libraries worldwide
This book constitutes the refereed preceedings of the 13th European Conference on Machine Learning, ECML 2002, held in Helsinki, Finland in August 2002. The 41 revised full papers presented together with 4 invited contributions were carefully reviewed and selected from numerous submissions. Among the topics covered are computational discovery, search strategies, Classification, support vector machines, kernel methods, rule induction, linear learning, decision tree learning, boosting, collaborative learning, statistical learning, clustering, instancebased learning, reinforcement learning, multiagent learning, multirelational learning, Markov decision processes, active learning, etc
The design of relational databases by
Heikki Mannila(
Book
)
15 editions published between 1992 and 1994 in English and held by 208 WorldCat member libraries worldwide
15 editions published between 1992 and 1994 in English and held by 208 WorldCat member libraries worldwide
Algorithms and applications : essays dedicated to Esko Ukkonen on the occasion of his 60th birthday by
Tapio Elomaa(
)
3 editions published in 2010 in English and Undetermined and held by 34 WorldCat member libraries worldwide
3 editions published in 2010 in English and Undetermined and held by 34 WorldCat member libraries worldwide
Principles of Data Mining and Knowledge Discovery 6th European Conference, PKDD 2002 Helsinki, Finland, August 1923, 2002
Proceedings by
Tapio Elomaa(
)
1 edition published in 2002 in English and held by 30 WorldCat member libraries worldwide
1 edition published in 2002 in English and held by 30 WorldCat member libraries worldwide
Machine Learning: ECML 2002 13th European Conference on Machine Learning Helsinki, Finland, August 1923, 2002 Proceedings by
Tapio Elomaa(
)
1 edition published in 2002 in English and held by 29 WorldCat member libraries worldwide
1 edition published in 2002 in English and held by 29 WorldCat member libraries worldwide
Instance complexity for sorting and NPcomplete problems by
Heikki Mannila(
Book
)
8 editions published in 1985 in English and held by 20 WorldCat member libraries worldwide
8 editions published in 1985 in English and held by 20 WorldCat member libraries worldwide
Right invariant metrics and measures of presortedness by Vladmir EstivillCastro(
Book
)
2 editions published in 1989 in English and held by 7 WorldCat member libraries worldwide
Abstract: "Right invariant metrics (rimetrics) have several applications in the theory of rank correlation methods. For example, ranking models based on rimetrics generalize Mallow's ranking models. We explore the relationship between right invariant metrics and measures of presortedness (mops). The latter have been used to evaluate the behavior of sorting algorithms on nearlysorted inputs. We give necessary and sufficient conditions for a measure of presortedness to be extended to a rimetric; we characterize those rimetrics that can be used as mops; and we show that those mops that are extendible to rimetrics can be constructed from sets of sorting operations. Our results provide a paradigm to construct mops and rimetrics."
2 editions published in 1989 in English and held by 7 WorldCat member libraries worldwide
Abstract: "Right invariant metrics (rimetrics) have several applications in the theory of rank correlation methods. For example, ranking models based on rimetrics generalize Mallow's ranking models. We explore the relationship between right invariant metrics and measures of presortedness (mops). The latter have been used to evaluate the behavior of sorting algorithms on nearlysorted inputs. We give necessary and sufficient conditions for a measure of presortedness to be extended to a rimetric; we characterize those rimetrics that can be used as mops; and we show that those mops that are extendible to rimetrics can be constructed from sets of sorting operations. Our results provide a paradigm to construct mops and rimetrics."
Discovering all most specific sentences by randomized algorithms by
Dimitrios Gunopulos(
Book
)
2 editions published in 1996 in English and held by 6 WorldCat member libraries worldwide
Abstract: "Data mining can in many instances be viewed as the task of computing a representation of a theory of a model or a database. In this paper we present a randomized algorithm that can be used to compute the representation of a theory in terms of the most specific sentences of that theory. In addition to randomization, the algorithm uses a generalization of the concept of hypergraph transversal. We apply the general algorithm in two ways, for the problem of discovering maximal frequent sets in 0/1 data, and for computing minimal keys in relations. We present some empirical results on the performance of these methods on real data. We also show some complexity theoretic evidence of the hardness of these problems."
2 editions published in 1996 in English and held by 6 WorldCat member libraries worldwide
Abstract: "Data mining can in many instances be viewed as the task of computing a representation of a theory of a model or a database. In this paper we present a randomized algorithm that can be used to compute the representation of a theory in terms of the most specific sentences of that theory. In addition to randomization, the algorithm uses a generalization of the concept of hypergraph transversal. We apply the general algorithm in two ways, for the problem of discovering maximal frequent sets in 0/1 data, and for computing minimal keys in relations. We present some empirical results on the performance of these methods on real data. We also show some complexity theoretic evidence of the hardness of these problems."
Recognizing renamable generalized propositional Horn formulas is NPcomplete by
Thomas Eiter(
Book
)
4 editions published in 1992 in English and held by 6 WorldCat member libraries worldwide
Abstract: "Yamasaki and Doshita have defined an extension of the class of propositional Horn formulas; later, Gallo and Scutellà generalized this class to a hierarchy [formula], where [gamma]₀ is the set of Horn formulas and [gamma]₁ is the class of Yamasaki and Doshita. For any fixed k, the propositional formulas in [gamma][subscript k] can be recognized in polynomial time, and the satisfiability problem for [gamma][subscript k] formulas can be solved in polynomial time. A possible way of extending these tractable subclasses of the satisfiability problem is to consider renamings: a renaming of a formula is obtained by replacing for some variables all their positive occurrences by negative occurrences and vice versa
4 editions published in 1992 in English and held by 6 WorldCat member libraries worldwide
Abstract: "Yamasaki and Doshita have defined an extension of the class of propositional Horn formulas; later, Gallo and Scutellà generalized this class to a hierarchy [formula], where [gamma]₀ is the set of Horn formulas and [gamma]₁ is the class of Yamasaki and Doshita. For any fixed k, the propositional formulas in [gamma][subscript k] can be recognized in polynomial time, and the satisfiability problem for [gamma][subscript k] formulas can be solved in polynomial time. A possible way of extending these tractable subclasses of the satisfiability problem is to consider renamings: a renaming of a formula is obtained by replacing for some variables all their positive occurrences by negative occurrences and vice versa
Ordered and unordered tree inclusion by
Pekka Kilpeläinen(
Book
)
4 editions published in 1991 in English and held by 6 WorldCat member libraries worldwide
Abstract: "We consider the following problem: Given labeled trees P and T, can P be obtained from T by deleting nodes? Deleting a node v entails removing all edges incident to v, and if v has a parent u, replacing the edge from u to v by edges from u to the children of v. The problem is motivated by the study of query languages for structured text data bases. Simple solutions to this problem require exponential time. For ordered trees we present an algorithm that requires [formula] time and space. We also consider the corresponding problem for unordered trees and give a proof of its NPcompleteness."
4 editions published in 1991 in English and held by 6 WorldCat member libraries worldwide
Abstract: "We consider the following problem: Given labeled trees P and T, can P be obtained from T by deleting nodes? Deleting a node v entails removing all edges incident to v, and if v has a parent u, replacing the edge from u to v by edges from u to the children of v. The problem is motivated by the study of query languages for structured text data bases. Simple solutions to this problem require exponential time. For ordered trees we present an algorithm that requires [formula] time and space. We also consider the corresponding problem for unordered trees and give a proof of its NPcompleteness."
Generating Armstrong databases for sets of functional and inclusion dependencies by
Heikki Mannila(
Book
)
4 editions published in 1988 in English and held by 6 WorldCat member libraries worldwide
4 editions published in 1988 in English and held by 6 WorldCat member libraries worldwide
Time parameter and arbitrary deunions in the set union problem by
Heikki Mannila(
Book
)
4 editions published in 1988 in English and held by 6 WorldCat member libraries worldwide
4 editions published in 1988 in English and held by 6 WorldCat member libraries worldwide
Design by example : an application of Armstrong relations by
Heikki Mannila(
Book
)
3 editions published in 1985 in English and held by 5 WorldCat member libraries worldwide
Example relations, and especially Armstrong relations, can be used as userfriendly representations of dependency sets. In this paper we analyze the use of Armstrong relations in database design with functional dependencies, and show how they and the usual representation of dependencies can be used together. Special attention is given to the size of Armstrong relations. We derive new bounds for the size of minimal Armstrong relations for normalized schemes. New algorithms are also given for generating Armstrong relations and for inferring the functional dependencies holding in a relation
3 editions published in 1985 in English and held by 5 WorldCat member libraries worldwide
Example relations, and especially Armstrong relations, can be used as userfriendly representations of dependency sets. In this paper we analyze the use of Armstrong relations in database design with functional dependencies, and show how they and the usual representation of dependencies can be used together. Special attention is given to the size of Armstrong relations. We derive new bounds for the size of minimal Armstrong relations for normalized schemes. New algorithms are also given for generating Armstrong relations and for inferring the functional dependencies holding in a relation
Machine Learning: ECML 2002 00 : 13th European Conference on Machine Learning Helsinki, Finland, August 1923, 2002 Proceedings(
)
1 edition published in 2002 in English and held by 5 WorldCat member libraries worldwide
1 edition published in 2002 in English and held by 5 WorldCat member libraries worldwide
Discovering all most specific sentences by randomized algorithms by Dimitris Gunopulos(
Book
)
1 edition published in 1996 in English and held by 5 WorldCat member libraries worldwide
1 edition published in 1996 in English and held by 5 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Elomaa, Tapio 1963 Author Editor
 Smyth, Padhraic
 Hand, D. J. (David J.) 1950 Author
 Toivonen, Hannu Author Editor
 Boulicaut, JeanFrançois Author Editor
 Raedt, Luc de 1964 Other Editor
 Orponen, Pekka Other Editor
 Ukkonen, E. (Esko) 1950 Honoree
 Hollmén, Jaakko Editor
 R�aih�a, KariJouko
Useful Links
Associated Subjects
Algorithms Artificial intelligence Computational complexity Computer science Computer software Database design Database management Database searching Data mining Discoveries in science Induction (Logic) Information storage and retrieval systems Machine learning NPcomplete problems Optical pattern recognition Pattern perception Relational databases ResearchAutomation ResearchData processing SciencePhilosophy Set theory Sorting (Electronic computers) Text processing (Computer science) Trees (Graph theory) Ukkonen, E.(Esko),