| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Taneli Mielikäinen Taneli Mielikäinen: Separating Structure from Interestingness. PAKDD 2004 : 476-485 Taneli Mielikäinen: Chaining Patterns. Discovery Science 2003 : 233-244 Taneli Mielikäinen: Intersecting data to closed sets with constraints. FIMI 2003 Taneli Mielikäinen: Change Profiles. ICDM 2003 : 219-226 Taneli Mielikäinen, Heikki Mannila : The Pattern Ordering Problem. PKDD 2003 : 327-338 Taneli Mielikäinen, Esko Ukkonen : The Complexity of Maximum Matroid-Greedoid Intersection. FCT 2001 : 535-540 1 [ 2 ] 2 [ 1 ]  ©2004 Association for Computing Machinery |
