|
Search the dblp DataBase
Taneli Mielikäinen:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Taneli Mielikäinen
Inductive Databases as Ranking. [Citation Graph (0, 0)][DBLP] DaWaK, 2004, pp:149-158 [Conf]
- Floris Geerts, Bart Goethals, Taneli Mielikäinen
Tiling Databases. [Citation Graph (0, 0)][DBLP] Discovery Science, 2004, pp:278-289 [Conf]
- Taneli Mielikäinen
Chaining Patterns. [Citation Graph (0, 0)][DBLP] Discovery Science, 2003, pp:233-244 [Conf]
- Taneli Mielikäinen
Privacy Problems with Anonymized Transaction Databases. [Citation Graph (0, 0)][DBLP] Discovery Science, 2004, pp:219-229 [Conf]
- Taneli Mielikäinen, Pance Panov, Saso Dzeroski
Itemset Support Queries Using Frequent Itemsets and Their Condensed Representations. [Citation Graph (0, 0)][DBLP] Discovery Science, 2006, pp:161-172 [Conf]
- Taneli Mielikäinen, Esko Ukkonen
The Complexity of Maximum Matroid-Greedoid Intersection. [Citation Graph (0, 0)][DBLP] FCT, 2001, pp:535-540 [Conf]
- Taneli Mielikäinen
Intersecting data to closed sets with constraints. [Citation Graph (0, 0)][DBLP] FIMI, 2003, pp:- [Conf]
- Ari Rantanen, Taneli Mielikäinen, Juho Rousu, Esko Ukkonen
Planning isotopomer measurements for estimation of metabolic fluxes. [Citation Graph (0, 0)][DBLP] German Conference on Bioinformatics, 2005, pp:177-191 [Conf]
- Taneli Mielikäinen, Janne Ravantti, Esko Ukkonen
The Computational Complexity of Orientation Search in Cryo-Electron Microscopy. [Citation Graph (0, 0)][DBLP] International Conference on Computational Science, 2004, pp:231-238 [Conf]
- Taneli Mielikäinen, Janne Ravantti
Sinogram Denoising of Cryo-Electron Microscopy Images. [Citation Graph (0, 0)][DBLP] ICCSA (4), 2005, pp:1251-1261 [Conf]
- Foto N. Afrati, Gautam Das, Aristides Gionis, Heikki Mannila, Taneli Mielikäinen, Panayiotis Tsaparas
Mining Chains of Relations. [Citation Graph (0, 0)][DBLP] ICDM, 2005, pp:553-556 [Conf]
- Taneli Mielikäinen
Change Profiles. [Citation Graph (0, 0)][DBLP] ICDM, 2003, pp:219-226 [Conf]
- Nikolaj Tatti, Taneli Mielikäinen, Aristides Gionis, Heikki Mannila
What is the Dimension of Your Binary Data? [Citation Graph (0, 0)][DBLP] ICDM, 2006, pp:603-612 [Conf]
- Sven Laur, Helger Lipmaa, Taneli Mielikäinen
Private Itemset Support Counting. [Citation Graph (0, 0)][DBLP] ICICS, 2005, pp:97-111 [Conf]
- Bart Goethals, Sven Laur, Helger Lipmaa, Taneli Mielikäinen
On Private Scalar Product Computation for Privacy-Preserving Data Mining. [Citation Graph (0, 0)][DBLP] ICISC, 2004, pp:104-120 [Conf]
- Aristides Gionis, Heikki Mannila, Taneli Mielikäinen, Panayiotis Tsaparas
Assessing data mining results via swap randomization. [Citation Graph (0, 0)][DBLP] KDD, 2006, pp:167-176 [Conf]
- Sven Laur, Helger Lipmaa, Taneli Mielikäinen
Cryptographically private support vector machines. [Citation Graph (0, 0)][DBLP] KDD, 2006, pp:618-624 [Conf]
- Taneli Mielikäinen, Evimaria Terzi, Panayiotis Tsaparas
Aggregating time partitions. [Citation Graph (0, 0)][DBLP] KDD, 2006, pp:347-356 [Conf]
- Floris Geerts, Bart Goethals, Taneli Mielikäinen
What You Store is What You Get. [Citation Graph (0, 0)][DBLP] KDID, 2003, pp:60-69 [Conf]
- Taneli Mielikäinen
Finding All Occurring Patterns of Interest. [Citation Graph (0, 0)][DBLP] KDID, 2003, pp:97-106 [Conf]
- Taneli Mielikäinen
An Automata Approach to Pattern Collections. [Citation Graph (0, 0)][DBLP] KDID, 2004, pp:130-149 [Conf]
- Taneli Mielikäinen
Implicit Enumeration of Patterns. [Citation Graph (0, 0)][DBLP] KDID, 2004, pp:150-172 [Conf]
- Taneli Mielikäinen
Transaction Databases, Frequent Itemsets, and Their Condensed Representations. [Citation Graph (0, 0)][DBLP] KDID, 2005, pp:139-164 [Conf]
- Taneli Mielikäinen
Separating Structure from Interestingness. [Citation Graph (0, 0)][DBLP] PAKDD, 2004, pp:476-485 [Conf]
- Taneli Mielikäinen, Heikki Mannila
The Pattern Ordering Problem. [Citation Graph (0, 0)][DBLP] PKDD, 2003, pp:327-338 [Conf]
- Pauli Miettinen, Taneli Mielikäinen, Aristides Gionis, Gautam Das, Heikki Mannila
The Discrete Basis Problem. [Citation Graph (0, 0)][DBLP] PKDD, 2006, pp:335-346 [Conf]
- Taneli Mielikäinen
Discovery of Serial Episodes from Streams of Events. [Citation Graph (0, 0)][DBLP] SSDBM, 2004, pp:447-0 [Conf]
- Ari Rantanen, Taneli Mielikäinen, Juho Rousu, Hannu Maaheimo, Esko Ukkonen
Planning optimal measurements of isotopomer distributions for estimation of metabolic fluxes. [Citation Graph (0, 0)][DBLP] Bioinformatics, 2006, v:22, n:10, pp:1198-1206 [Journal]
- Taneli Mielikäinen, Esko Ukkonen
The Complexity of Maximum Matroid-Greedoid Intersection and Weighted Greedoid Maximization [Citation Graph (0, 0)][DBLP] CoRR, 2004, v:0, n:, pp:- [Journal]
- Taneli Mielikäinen, Janne Ravantti, Esko Ukkonen
The Computational Complexity of Orientation Search Problems in Cryo-Electron Microscopy [Citation Graph (0, 0)][DBLP] CoRR, 2004, v:0, n:, pp:- [Journal]
- Taneli Mielikäinen
Frequency-based views to pattern collections. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2006, v:154, n:7, pp:1113-1139 [Journal]
- Taneli Mielikäinen, Esko Ukkonen
The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization, . [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2006, v:154, n:4, pp:684-691 [Journal]
- Hannes Heikinheimo, Jouni K. Seppänen, Eino Hinkkanen, Heikki Mannila, Taneli Mielikäinen
Finding low-entropy sets and trees from binary data. [Citation Graph (0, 0)][DBLP] KDD, 2007, pp:350-359 [Conf]
- Matti Kääriäinen, Niels Landwehr, Sampsa Lappalainen, Taneli Mielikäinen
Combining haplotypers [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
Ab Initio Prediction of Molecular Fragments from Tandem Mass Spectrometry Data. [Citation Graph (, )][DBLP]
Probabilistic Logic Learning from Haplotype Data. [Citation Graph (, )][DBLP]
Misco: a MapReduce framework for mobile systems. [Citation Graph (, )][DBLP]
Constrained hidden Markov models for population-based haplotyping. [Citation Graph (, )][DBLP]
Summarization Techniques for Pattern Collections in Data Mining [Citation Graph (, )][DBLP]
Search in 0.033secs, Finished in 0.035secs
|