Home > People > taneli_mielikainen

Taneli Mielikäinen
Research Leader
Data Insight Program, NRC Palo Alto, USA
Contact

 

I am with Data Insight Program of Nokia Research Center and I am located in  NRC Palo Alto, California. I am also an adjunct professor in Computer Science at University of Helsinki, Finland.

Background

Before joining Nokia, I was doing research at HIIT BRU and FDK on various topics, including computational biology (metabolic networks, haplotype analysis, cryo-electron microscopy) data mining (pattern discovery and foundations of data mining, privacy in data analysis, inductive databases, probabilistic logic learning) and combinatorial optimization.

I defended my PhD Thesis on summarization techniques for pattern collections in data mining in May 2005. For my MSc thesis I studied the computational complexity of determining relative orientations of cryo-electron microscope images of macromolecular complexes and implemented a software system Orient Express for experimenting with different heuristic search techniques.

 

Professional Activities

 

Publications

Markus Heinonen, Ari Rantanen, Taneli Mielikäinen, Juha Kokkonen, Jari Kiuru, Raimo A. Ketola, Juho Rousu FiD: a software for ab initio structural identification of product ions from tandem mass spectrometric data. Rapid Communications in Mass Spectrometry 22:3043-3052. Wiley, 2008.

Niels Landwehr and Taneli Mielikäinen. Probabilistic logic learning from haplotype data. In Luc De Raedt, Paolo Frasconi, and Kristian Kersting: Probabilistic Inductive Logic Programming: Theory and Application, LNCS 4911:263-286. Springer, 2008.

Pauli Miettinen, Taneli Mielikäinen, Aristides Gionis, Gautam Das, and Heikki Mannila. The Discrete Basis Problem. IEEE Transactions on Knowledge and Data Engineering 20(10):1348--1362. IEEE Computer Society, 2008.

Richard A. Hankins, Esa Eteläperä, Yiming Ma, Taneli Mielikäinen, and David Racz. Everybit. A Community Platform for Experimenting with Mobile Data. Ninth Workshop on Mobile Computing Systems and Applications (HotMobile 2008). ACM, 2008.

Aristides Gionis, Heikki Mannila, Taneli Mielikäinen, and Panayiotis Tsaparas. Assessing data mining results via swap randomization. ACM Transactions on Knowledge Discovery from Data 1(3):14. ACM, 2007.

Matti Kääriäinen, Niels Landwehr, Sampsa Lappalainen, and Taneli Mielikäinen. Combining haplotypers. Report C-2007-57. Department of Computer Science, University of Helsinki, 2007.

Hannes Heikinheimo, Eino Hinkkanen, Heikki Mannila, Taneli Mielikäinen, and Jouni Seppänen. Finding low-entropy sets and trees from binary data. In: The Thirteenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2007), pp. 350-359. ACM, 2007.

Niels Landwehr, Taneli Mielikäinen, Lauri Eronen, Hannu Toivonen, and Heikki Mannila. Constrained hidden Markov models for population-based haplotyping. BMC Bioinformatics 8 (Suppl 2):S9. BioMed Central, 2007.

Nikolaj Tatti, Taneli Mielikäinen, Aristides Gionis, and Heikki Mannila. What is the dimension of your binary data?. In The 2006 IEEE Conference on Data Mining (ICDM 2006). pp. ?-?. IEEE Computer Society, 2006.

Markus Heinonen, Ari Rantanen, Taneli Mielikäinen, Esa Pitkänen, Juha Kokkonen, and Juho Rousu. Ab Initio Prediction of Molecular Fragments from Tandem Mass Spectrometry Data. In German Conference on Bioinformatics 2006 (GCB'06). pp. ?-?. 2006.

Taneli Mielikäinen, Panče Panov, and Sašo Džeroski. Itemset Support Queries using Frequent Itemsets and Their Condensed Representations. In Nada Lavrač and Ljupčo Todorovski (Eds.): Discovery Science (DS) - 9th International Conference on Discovery Science (DS 2006), LNAI 4265:161-172. Springer, 2006.

Pauli Miettinen, Taneli Mielikäinen, Aristides Gionis, Gautam Das, and Heikki Mannila. The Discrete Basis Problem. In Johannes Fürnkranz, Tobias Scheffer, and Myra Spiliopoulou (Eds.): Knowledge Discovery in Databases: PKDD 2006 - 10th European Conference on Principles and Practice of Knowledge Discovery in Databases, LNAI 4213:335-346. Springer, 2006.

Sven Laur, Helger Lipmaa, and Taneli Mielikäinen. Cryptographically Private Support Vector Machines. In Mark Craven and Dimitrios Gunopulos (Eds.): The Twelfth Annual SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2006). pp. 618-624. ACM, 2006.

Aristides Gionis, Heikki Mannila, Taneli Mielikäinen, and Panayiotis Tsaparas. Assessing data mining results via swap randomization. In Mark Craven and Dimitrios Gunopulos (Eds.): The Twelfth Annual SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2006). pp. 157-176. ACM, 2006. (The code is available.)

Taneli Mielikäinen, Evimaria Terzi, and Panayiotis Tsaparas. Aggregating Time Partitions. In Mark Craven and Dimitrios Gunopulos (Eds.): The Twelfth Annual SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2006). pp. 347-356. ACM, 2006.

Niels Landwehr, Taneli Mielikäinen, Lauri Eronen, Hannu Toivonen, and Heikki Mannila. Constrained Hidden Markov Models for Population-based Haplotyping (Extended Abstract). In: Probabilistic Modeling and Machine Learning in Structural and Systems Biology (PMSB 2006). pp. 38-43. 2006. (The program is available.)

Ari Rantanen, Taneli Mielikäinen, Juho Rousu, Hannu Maaheimo, and Esko Ukkonen. Planning optimal measurements of isotopomer distributions for estimation of metabolic fluxes. Bioinformatics 22(10):1198-1206. Oxford University Press, 2006.

Taneli Mielikäinen. Frequency-Based Views to Pattern Collections. Discrete Applied Mathematics, 154(7):1113-1139. Elsevier, 2006. (The code is available.)

Taneli Mielikäinen. Transaction databases, Frequent Itemsets, and Their Condensed Representations. In Francesco Bonchi and Jean-François Boulicaut (Eds.): Fourth International Workshop on Knowledge Discovery in Inductive Databases (KDID 2005). LNCS 3933:139-164. Springer, 2006.

Taneli Mielikäinen and Esko Ukkonen. The Complexity of Maximum Matroid-Greedoid Intersection and Weighted Greedoid Maximization. Discrete Applied Mathematics, 154(4):684-691. Elsevier, 2006.

Sven Laur, Helger Lipmaa, and Taneli Mielikäinen. Private Itemset Support Counting. In Sihan Qing, Wenbo Mao, Javier Lopez, and Guilin Wang (Eds.): Seventh International Conference on Information and Communications Security (ICICS '05). LNCS 3783:97-111. Springer, 2005.

Foto Afrati, Gautam Das, Aristides Gionis, Heikki Mannila, Taneli Mielikäinen, and Panayiotis Tsaparas. Mining Chains of Relations. In Jiawei Han, Benjamin Wah, and Xindong Wu (Eds.): The 5th IEEE International Conference on Data Mining (ICDM 2005). pp. 553-556. IEEE Computer Society, 2005.

Taneli Mielikäinen. Summarization Techniques for Pattern Collections in Data Mining. PhD Thesis. Report A-2005-1. Department of Computer Science, University of Helsinki, 2005.

Ari Rantanen, Taneli Mielikäinen, Juho Rousu, and Esko Ukkonen. Planning isotopomer measurements for estimation of metabolic fluxes. In German Conference on Bioinformatics 2005 (GCB'05). pp. 177-191. 2005.

Taneli Mielikäinen and Janne Ravantti. Sinogram Denoising of Cryo-Electron Microscopy Images. In Osvaldo Gervasi, Marina L. Gavrilova, Vipin Kumar, Antonio Laganà, Heow Pueh Lee, Youngsong Mun, David Taniar, Chih Jeng Kenneth Tan (Eds.): International Conference on Computational Science and Its Applications (ICCSA 2005). LNCS 3483:1251-1261. Springer, 2005.

Bart Goethals, Sven Laur, Helger Lipmaa, and Taneli Mielikäinen. On Private Scalar Product Computation for Privacy-Preserving Data Mining. In Choonsik Park and Seongtaek Chee (Eds.): 7th International Conference on Information Security and Cryptology (ICISC 2004). LNCS 3506:104-120. Springer, 2005.

Taneli Mielikäinen. An Automata Approach to Pattern Collections. In Bart Goethals and Arno Siebes (Eds.): Third International Workshop on Knowledge Discovery in Inductive Databases (KDID 2004). LNCS 3377:130-149. Springer, 2005.

Taneli Mielikäinen. Implicit Enumeration of Patterns. In Bart Goethals and Arno Siebes (Eds.): Third International Workshop on Knowledge Discovery in Inductive Databases (KDID 2004). LNCS 3377:150-172. Springer, 2005.

Taneli Mielikäinen. Privacy Problems with Anonymized Transaction Databases. In Setsuo Arikawa and Einoshin Suzuki (Eds.): Discovery Science (DS) - 7th International Conference on Discovery Science (DS 2004), LNAI 3245:219-229. Springer, 2004. (The code is available.)

Floris Geerts, Bart Goethals, Taneli Mielikäinen. Tiling Databases. In Setsuo Arikawa and Einoshin Suzuki (Eds.): Discovery Science (DS) - 7th International Conference on Discovery Science (DS 2004), LNAI 3245:278-289. Springer, 2004.

Taneli Mielikäinen. Inductive Databases as Ranking. In Yahiko Kambayashi, Mukesh Mohania and Wolfram Wöß (Eds.): Data Warehousing and Knowledge Discovery - 7th International Conference on Data Warehousing and Knowledge Discovery (DaWaK 2004), LNCS 3181:149-158. Springer, 2004.

Taneli Mielikäinen. Discovery of Serial Episodes from Streams of Events. In Michael Hatzopoulos and Yannis Manolopoulos (Eds.) 16th International Conference on Scientific and Statistical Database Management (SSBDM 2004), pp. 447-448. IEEE Computer Society, 2004.

Taneli Mielikäinen and Esko Ukkonen. The Complexity of Maximum Matroid-Greedoid Intersection and Weighted Greedoid Maximization. Report C-2004-2. Department of Computer Science, University of Helsinki, 2004.

Taneli Mielikäinen, Janne Ravantti and Esko Ukkonen. The Computational Complexity of Orientation Search Problems in Cryo-Electron Microscopy. Report C-2004-3. Department of Computer Science, University of Helsinki, 2004.

Taneli Mielikäinen, Janne Ravantti, and Esko Ukkonen. The Computational Complexity of Orientation Search in Cryo-Electron Microscopy. In Marian Bubak, G. Dick van Albada, Peter M. A. Sloot, and Jack J. Dongarra (Eds.): Computational Science - International Conference on Computational Science (ICCS 2004). LNCS 3036: 231-238. Springer, 2004.

Taneli Mielikäinen. Separating Structure from Interestingness. In Honghua Dai, Ramakrishnan Srikant, and Chengqi Zhang (Eds.): Advances in Knowledge Discovery and Data Mining - 8th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2004). LNAI 3056:476-485. Springer, 2004

Taneli Mielikäinen. Change Profiles. In Xindong Wu and Alex Tuzhilin (Eds.): Third IEEE International Conference on Data Mining (ICDM 2003). pp. 219-226. IEEE Computer Society, 2003.

Taneli Mielikäinen. On Inverse Frequent Set Mining. In Wenliang Du and Christopher W. Clifton (Eds.): 2nd Workshop on Privacy Preserving Data Mining (PPDM 2003). pp. 18-23 IEEE Computer Society, 2003.

Taneli Mielikäinen. Intersecting Data to Closed Sets with Constraints. In Bart Goethals and Mohammed Zaki (Eds.): Workshop on Frequent Itemset Mining Implementations (FIMI'03). CEUR Workshop Proceedings 90, 2003. (The code is available.)

Taneli Mielikäinen. Chaining Patterns. In Gunter Grieser, Yuzuru Tanaka and Akihiro Yamamoto (Eds.): Discovery Science (DS) - 6th International Conference on Discovery Science (DS 2003) , LNAI 2843:233-244. Springer, 2003.

Taneli Mielikäinen and Heikki Mannila The Pattern Ordering Problem. In N. Lavrac, D. Gamberger, L. Todorovski and H. Blockeel (Eds.): Knowledge Discovery in Databases: PKDD 2003 - 7th European Conference on Principles and Practice of Knowledge Discovery in Databases, LNAI 2838:327-338. Springer, 2003.

Taneli Mielikäinen. Finding All Occurring Sets of Interest. In Jean-François Boulicaut and Sašo Džeroski (Eds.): 2nd International Workshop on Knowledge Discovery in Inductive Databases (KDID'03). pp. 97-106. 2003.

Floris Geerts, Bart Goethals and Taneli Mielikäinen. What You Store Is What You Get (extended abstract). In Jean-François Boulicaut and Sašo Džeroski (Eds.): 2nd International Workshop on Knowledge Discovery in Inductive Databases (KDID'03). pp. 60-69. 2003.

Taneli Mielikäinen. Läpivalaisukuvien orientointi. Master's Thesis. Report C-2002-14. Department of Computer Science, University of Helsinki, 2002.

Taneli Mielikäinen. Frequency-Based Views to Pattern Collections. In P. L. Hammer (Ed.): IFIP/SIAM Workshop on Discrete Mathematics and Data Mining (DM & DM 2003). 2003.

Taneli Mielikäinen and Esko Ukkonen. The Complexity of Maximum Matroid-Greedoid Intersection. In R. Freivalds (Ed.): Fundamentals of Computation Theory (FCT 2001). LNCS 2138:535-539. Springer, 2001.

 
Terms Of Use | Privacy Policy | Copyright © 2009 Nokia. All rights reserved.