default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTaneli Mielikäinen
Person information
- affiliation: University of Helsinki, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[i6]Nikolaj Tatti, Taneli Mielikäinen, Aristides Gionis, Heikki Mannila:
What is the dimension of your binary data? CoRR abs/1902.01480 (2019)- 2017
- [e1]Yasemin Altun, Kamalika Das, Taneli Mielikäinen, Donato Malerba, Jerzy Stefanowski
, Jesse Read, Marinka Zitnik, Michelangelo Ceci, Saso Dzeroski:
Machine Learning and Knowledge Discovery in Databases - European Conference, ECML PKDD 2017, Skopje, Macedonia, September 18-22, 2017, Proceedings, Part III. Lecture Notes in Computer Science 10536, Springer 2017, ISBN 978-3-319-71272-7 [contents] - 2014
- [c33]Jingu Kim, Taneli Mielikäinen:
Conditional Log-linear Models for Mobile Application Usage Prediction. ECML/PKDD (1) 2014: 672-687 - 2011
- [j7]Markus Heinonen, Sampsa Lappalainen, Taneli Mielikäinen, Juho Rousu:
Computing Atom Mappings for Biochemical Reactions without Subgraph Isomorphism. J. Comput. Biol. 18(1): 43-58 (2011) - [c32]Adam Ji Dou, Vana Kalogeraki, Dimitrios Gunopulos, Taneli Mielikäinen, Ville H. Tuulos:
Scheduling for real-time mobile MapReduce systems. DEBS 2011: 347-358 - [c31]Adam Ji Dou, Vana Kalogeraki, Dimitrios Gunopulos, Taneli Mielikäinen, Ville H. Tuulos, Sean Foley, Curtis Yu:
Data Clustering on a Network of Mobile Smartphones. SAINT 2011: 118-127 - 2010
- [c30]Adam Ji Dou, Vana Kalogeraki, Dimitrios Gunopulos, Taneli Mielikäinen, Ville H. Tuulos:
Misco: a MapReduce framework for mobile systems. PETRA 2010
2000 – 2009
- 2008
- [j6]Pauli Miettinen, Taneli Mielikäinen, Aristides Gionis, Gautam Das, Heikki Mannila:
The Discrete Basis Problem. IEEE Trans. Knowl. Data Eng. 20(10): 1348-1362 (2008) - [p1]Niels Landwehr, Taneli Mielikäinen:
Probabilistic Logic Learning from Haplotype Data. Probabilistic Inductive Logic Programming 2008: 263-286 - 2007
- [j5]Niels Landwehr, Taneli Mielikäinen, Lauri Eronen, Hannu Toivonen, Heikki Mannila:
Constrained hidden Markov models for population-based haplotyping. BMC Bioinform. 8(S-2) (2007) - [j4]Aristides Gionis, Heikki Mannila, Taneli Mielikäinen, Panayiotis Tsaparas:
Assessing data mining results via swap randomization. ACM Trans. Knowl. Discov. Data 1(3): 14 (2007) - [c29]Hannes Heikinheimo, Jouni K. Seppänen, Eino Hinkkanen, Heikki Mannila, Taneli Mielikäinen:
Finding low-entropy sets and trees from binary data. KDD 2007: 350-359 - [i5]Matti Kääriäinen, Niels Landwehr, Sampsa Lappalainen, Taneli Mielikäinen:
Combining haplotypers. CoRR abs/0710.5116 (2007) - 2006
- [j3]Ari Rantanen, Taneli Mielikäinen, Juho Rousu, Hannu Maaheimo, Esko Ukkonen:
Planning optimal measurements of isotopomer distributions for estimation of metabolic fluxes. Bioinform. 22(10): 1198-1206 (2006) - [j2]Taneli Mielikäinen, Esko Ukkonen:
The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization, . Discret. Appl. Math. 154(4): 684-691 (2006) - [j1]Taneli Mielikäinen:
Frequency-based views to pattern collections. Discret. Appl. Math. 154(7): 1113-1139 (2006) - [c28]Taneli Mielikäinen, Pance Panov, Saso Dzeroski:
Itemset Support Queries Using Frequent Itemsets and Their Condensed Representations. Discovery Science 2006: 161-172 - [c27]Markus Heinonen, Ari Rantanen, Taneli Mielikäinen, Esa Pitkänen, Juha Kokkonen, Juho Rousu:
Ab Initio Prediction of Molecular Fragments from Tandem Mass Spectrometry Data. German Conference on Bioinformatics 2006: 40-53 - [c26]Nikolaj Tatti, Taneli Mielikäinen, Aristides Gionis, Heikki Mannila:
What is the Dimension of Your Binary Data? ICDM 2006: 603-612 - [c25]Aristides Gionis, Heikki Mannila, Taneli Mielikäinen, Panayiotis Tsaparas:
Assessing data mining results via swap randomization. KDD 2006: 167-176 - [c24]Taneli Mielikäinen, Evimaria Terzi, Panayiotis Tsaparas:
Aggregating time partitions. KDD 2006: 347-356 - [c23]Sven Laur, Helger Lipmaa, Taneli Mielikäinen:
Cryptographically private support vector machines. KDD 2006: 618-624 - [c22]Pauli Miettinen, Taneli Mielikäinen, Aristides Gionis, Gautam Das, Heikki Mannila:
The Discrete Basis Problem. PKDD 2006: 335-346 - [i4]Sven Laur, Helger Lipmaa, Taneli Mielikäinen:
Cryptographically Private Support Vector Machines. IACR Cryptol. ePrint Arch. 2006: 198 (2006) - 2005
- [c21]Ari Rantanen, Taneli Mielikäinen, Juho Rousu, Esko Ukkonen:
Planning isotopomer measurements for estimation of metabolic fluxes. German Conference on Bioinformatics 2005: 177-191 - [c20]Taneli Mielikäinen, Janne Ravantti:
Sinogram Denoising of Cryo-Electron Microscopy Images. ICCSA (4) 2005: 1251-1261 - [c19]Foto N. Afrati, Gautam Das, Aristides Gionis, Heikki Mannila, Taneli Mielikäinen, Panayiotis Tsaparas:
Mining Chains of Relations. ICDM 2005: 553-556 - [c18]Sven Laur, Helger Lipmaa, Taneli Mielikäinen:
Private Itemset Support Counting. ICICS 2005: 97-111 - [c17]Taneli Mielikäinen:
Transaction Databases, Frequent Itemsets, and Their Condensed Representations. KDID 2005: 139-164 - [i3]Taneli Mielikäinen:
Summarization Techniques for Pattern Collections in Data Mining. CoRR abs/cs/0505071 (2005) - 2004
- [c16]Taneli Mielikäinen:
Inductive Databases as Ranking. DaWaK 2004: 149-158 - [c15]Taneli Mielikäinen:
Privacy Problems with Anonymized Transaction Databases. Discovery Science 2004: 219-229 - [c14]Floris Geerts, Bart Goethals, Taneli Mielikäinen:
Tiling Databases. Discovery Science 2004: 278-289 - [c13]Taneli Mielikäinen, Janne Ravantti, Esko Ukkonen:
The Computational Complexity of Orientation Search in Cryo-Electron Microscopy. International Conference on Computational Science 2004: 231-238 - [c12]Bart Goethals, Sven Laur, Helger Lipmaa, Taneli Mielikäinen:
On Private Scalar Product Computation for Privacy-Preserving Data Mining. ICISC 2004: 104-120 - [c11]Taneli Mielikäinen:
An Automata Approach to Pattern Collections. KDID 2004: 130-149 - [c10]Taneli Mielikäinen:
Implicit Enumeration of Patterns. KDID 2004: 150-172 - [c9]Taneli Mielikäinen:
Separating Structure from Interestingness. PAKDD 2004: 476-485 - [c8]Taneli Mielikäinen:
Discovery of Serial Episodes from Streams of Events. SSDBM 2004: 447-448 - [i2]Taneli Mielikäinen, Esko Ukkonen:
The Complexity of Maximum Matroid-Greedoid Intersection and Weighted Greedoid Maximization. CoRR cs.DS/0405094 (2004) - [i1]Taneli Mielikäinen, Janne Ravantti, Esko Ukkonen:
The Computational Complexity of Orientation Search Problems in Cryo-Electron Microscopy. CoRR cs.DS/0406043 (2004) - 2003
- [c7]Taneli Mielikäinen:
Chaining Patterns. Discovery Science 2003: 233-244 - [c6]Taneli Mielikäinen:
Intersecting data to closed sets with constraints. FIMI 2003 - [c5]Taneli Mielikäinen:
Change Profiles. ICDM 2003: 219-226 - [c4]Floris Geerts, Bart Goethals, Taneli Mielikäinen:
What You Store is What You Get. KDID 2003: 60-69 - [c3]Taneli Mielikäinen:
Finding All Occurring Patterns of Interest. KDID 2003: 97-106 - [c2]Taneli Mielikäinen, Heikki Mannila:
The Pattern Ordering Problem. PKDD 2003: 327-338 - 2001
- [c1]Taneli Mielikäinen, Esko Ukkonen:
The Complexity of Maximum Matroid-Greedoid Intersection. FCT 2001: 535-540
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
