Heikki Mannila. Local and global methods in data mining: Basic techniques and open problems. In P. Widmayer, F. Triguero, R. Morales, M. Hennessy, S. Eidenbenz, and R. Conejo, editors, Automata, Languages and Programming, volume 2380 of LNCS, pages 57--68. Springer, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Basis of Tiling Motifs for Generating Repeated.. - Pisanti.. (2003) (1 citation) (Correct)
....algorithm exists only for xed quorum. 1 Introduction Identifying repeated patterns in strings is a computationally demanding task on the large data sets available in computational biology, data mining, textual document processing, system security, and other areas; for instance, see [6]. We consider patterns with don t cares in a given string s of n symbols drawn over an alphabet . The don t care is a special symbol matching any symbol of ; for example, pattern TE matches both TTE and TEE inside s = COMMITTEE (note that a pattern cannot have a don t care at the beginning or ....
H. Mannila. Local and global methods in data mining: basic techniques and open problems. In P. et al., editor, International Colloquium on Automata, Languages, and Programming, volume 2380 of LNCS, pages 57-68. Springer-Verlag, 2002.
Bases of Motifs for Generating Repeated Patterns with.. - Pisanti, Crochemore.. (2003) (1 citation) (Correct)
....and Wellcome Trust Foundation. 1 Introduction Identifying repetitive patterns in strings (sequences) is a computationally demanding task on the large data sets available in computational biology, data mining, textual document processing, system security, and other areas; for instance, see [10]. We consider patterns with don t cares in a given string s of n symbols drawn over an alphabet . The don t care is a special symbol matching any symbol of ; for example, pattern TE matches both TTE and TEE inside s = COMMITTEE. Note that a pattern cannot have a don t care at the beginning ....
H. Mannila. Local and global methods in data mining: basic techniques and open problems. In P. W. et al., editor, 29th International Colloquium on Automata, Languages, and Programming, volume 2380 of Lecture Notes in Computer Science, pages 57-68. Springer-Verlag, 2002.
Frequency-Based Views to Pattern Collections - Mielikäinen (2003) (Correct)
....e#cient algorithms minimizing several error functions. In addition, we show that the discretizations can be used to find small approximate condensed representations for the frequent patterns. 1 Introduction Finding interesting patterns from data sets is the fundamental problem in data mining [24, 25, 34]. This problem is known as the pattern discovery problem. The interestingness of a pattern depends (at least) on the data set and the objective of the data analysis. While surprising patterns could be interesting one day, some other day it might be more interesting to find regularities of the ....
H. Mannila, Local and global methods in data mining: Basic techniques and open problems, in Automata, Languages and Programming, P. Widmayer, F. Triguero, R. Morales, M. Hennessy, S. Eidenbenz, and R. Conejo, eds., vol. 2380 of Lecture Notes in Computer Science, Springer-Verlag, 2002, pp. 57--68.
Boolean Formulas and Frequent Sets - Jouni Seppnen And (2005) Self-citation (Mannila) (Correct)
No context found.
Heikki Mannila. Local and global methods in data mining: Basic techniques and open problems. In P. Widmayer, F. Triguero, R. Morales, M. Hennessy, S. Eidenbenz, and R. Conejo, editors, Automata, Languages and Programming, volume 2380 of LNCS, pages 57--68. Springer, 2002.
The Pattern Ordering Problem - Mielikäinen, Mannila Self-citation (Mannila) (Correct)
No context found.
Mannila, H.: Local and global methods in data mining: Basic techniques and open problems. In Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R., eds.: Automata, Languages and Programming. Volume 2380 of Lecture Notes in Computer Science., Springer-Verlag (2002) 57--68
The Pattern Ordering Problem - Mielikäinen, Mannila (2003) Self-citation (Mannila) (Correct)
No context found.
Mannila, H.: Local and global methods in data mining: Basic techniques and open problems. In Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R., eds.: Automata, Languages and Programming. Volume 2380 of Lecture Notes in Computer Science., Springer-Verlag (2002) 57--68
On Inverse Frequent Set Mining - Mielikäinen (2003) (Correct)
No context found.
H. Mannila. Local and global methods in data mining: Basic techniques and open problems. In P. Widmayer, F. Triguero, R. Morales, M. Hennessy, S. Eidenbenz, and R. Conejo, editors, Automata, Languages and Programming, volume 2380 of Lecture Notes in Computer Science, pages 57--68. Springer-Verlag, 2002.
Change Profiles - Mielikäinen (Correct)
No context found.
H. Mannila. Local and global methods in data mining: Basic techniques and open problems. In P. Widmayer, F. Triguero, R. Morales, M. Hennessy, S. Eidenbenz, and R. Conejo, editors, Automata, Languages and Programming, volume 2380 of Lecture Notes in Computer Science, pages 57--68. Springer-Verlag, 2002.
Inductive Databases as Ranking - Mielikäinen (Correct)
No context found.
Mannila, H.: Local and global methods in data mining: Basic techniques and open problems. In Widmayer, P., Ruiz, F.T., Bueno, R.M., Hennessy, M., Eidenbenz, S., Conejo, R., eds.: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings. Volume 2380 of Lecture Notes in Computer Science. Springer (2002) 57--68
Separating Structure from Interestingness - Mielikäinen (Correct)
No context found.
Mannila, H.: Local and global methods in data mining: Basic techniques and open problems. In Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R., eds.: Automata, Languages and Programming. Volume 2380 of Lecture Notes in Computer Science., Springer-Verlag (2002) 57--68
Finding All Occurring Sets of Interest - Mielikäinen (2003) (Correct)
No context found.
Mannila, H.: Local and global methods in data mining: Basic techniques and open problems. In Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R., eds.: Automata, Languages and Programming. Volume 2380 of LNCS., Springer-Verlag (2002) 57--68
Chaining Patterns - Mielikäinen (2003) (Correct)
No context found.
Mannila, H.: Local and global methods in data mining: Basic techniques and open problems. In Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R., eds.: Automata, Languages and Programming. Volume 2380 of LNCS., Springer-Verlag (2002) 57--68
Inductive Databases as Ranking - Mielikäinen (Correct)
No context found.
Mannila, H.: Local and global methods in data mining: Basic techniques and open problems. In Widmayer, P., Ruiz, F.T., Bueno, R.M., Hennessy, M., Eidenbenz, S., Conejo, R., eds.: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings. Volume 2380 of Lecture Notes in Computer Science. Springer (2002) 57--68
Interestingness of Frequent Itemsets Using Bayesian.. - Jaroszewicz, Simovici (2004) (Correct)
No context found.
Heikki Mannila. Local and global methods in data mining: Basic techniques and open problems. In ICALP 2002.
Finding All Occurring Sets of Interest - Mielikäinen (2003) (Correct)
No context found.
Mannila, H.: Local and global methods in data mining: Basic techniques and open problems. In Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R., eds.: Automata, Languages and Programming. Volume 2380 of LNCS., Springer-Verlag (2002) 57--68
Chaining Patterns - Mielikäinen (2003) (Correct)
No context found.
Mannila, H.: Local and global methods in data mining: Basic techniques and open problems. In Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R., eds.: Automata, Languages and Programming. Volume 2380 of LNCS., Springer-Verlag (2002) 57--68
Separating Structure from Interestingness - Mielikäinen (2004) (Correct)
No context found.
Mannila, H.: Local and global methods in data mining: Basic techniques and open problems. In Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R., eds.: Automata, Languages and Programming. Volume 2380 of Lecture Notes in Computer Science., Springer-Verlag (2002) 57--68
On Inverse Frequent Set Mining - Mielikäinen (2003) (Correct)
No context found.
H. Mannila. Local and global methods in data mining: Basic techniques and open problems. In P. Widmayer, F. Triguero, R. Morales, M. Hennessy, S. Eidenbenz, and R. Conejo, editors, Automata, Languages and Programming, volume 2380 of Lecture Notes in Computer Science, pages 57--68. Springer-Verlag, 2002.
Change Profiles - Mielikäinen (Correct)
No context found.
H. Mannila. Local and global methods in data mining: Basic techniques and open problems. In P. Widmayer, F. Triguero, R. Morales, M. Hennessy, S. Eidenbenz, and R. Conejo, editors, Automata, Languages and Programming, volume 2380 of Lecture Notes in Computer Science, pages 57--68. Springer-Verlag, 2002.
Interestingness of Frequent Itemsets Using Bayesian.. - Jaroszewicz, Simovici (Correct)
No context found.
Heikki Mannila. Local and global methods in data mining: Basic techniques and open problems. In ICALP 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC