Heikki Mannila - Citegraph

Author Info

Name	Affiliation	Papers
HEIKKI MANNILA	Department of Computer Science, P.O. Box 26, FIN-00014 University of Helsinki, Finland. E-mail: heikki.mannila@cs.helsinki.fi, hannu.toivonen@cs.helsinki.fi, inkeri.verkamo@cs.helsinki.fi	179
Collaborators	Citations	PageRank
158	6595	1495.69
Referers	Referees	References
8906	1902	1936

Search Limit

1001000

Publications (100 rows)

Collaborators (100 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Significance Testing Of Word Frequencies In Corpora	2	0.45	2016
Probabilistic Models for Query Approximation with Large Sparse Binary Datasets	0	0.34	2013
Randomization techniques for assessing the significance of gene periodicity results.	3	0.51	2011
A shapley value approach for influence attribution	9	0.58	2011
Analyzing word frequencies in large text corpora using inter-arrival times and bootstrapping	7	0.53	2011
Finding effectors in social networks	93	4.14	2010
Gaussian clusters and noise: an approach based on the minimum description length principle	1	0.40	2010
Evaluation of BIC and cross validation for model selection on sequence segmentations.	0	0.34	2010
Low-Entropy Set Selection	10	0.67	2009
Tell me something I don't know: randomization strategies for iterative data mining	46	1.56	2009
Query Significance in Databases via Randomizations	0	0.34	2009
Randomization methods for assessing data analysis results on real-valued matrices	14	0.80	2009
Determining Attributes to Maximize Visibility of Objects	8	0.52	2009
Approximating the Minimum Chain Completion problem	4	0.51	2009
Complexity control in a mixture model by the Hardy-Weinberg equilibrium	0	0.34	2009
Randomization Methods for Assessing the Significance of Data Mining Results	0	0.34	2009
The Discrete Basis Problem	61	3.60	2008
Finding Links and Initiators: A Graph-Reconstruction Problem	4	0.65	2008
Randomization Techniques for Data Mining Methods	3	0.48	2008
Nestedness and segmented nestedness	17	1.59	2007
Constrained hidden Markov models for population-based haplotyping.	32	1.17	2007
Clustering aggregation	109	3.11	2007
Finding trees from unordered 0–1 data	1	0.39	2006
Finding fragments of orders and total orders from 0-1 data	0	0.34	2006
What is the Dimension of Your Binary Data?	27	1.79	2006
Constraint-Based Mining and Inductive Databases: European Workshop on Inductive Databases and Constraint Based Mining, Hinterzarten, Germany, March 11-13, ... / Lecture Notes in Artificial Intelligence)	23	0.97	2005
Parameter-Free Spatial Data Mining Using MDL	9	0.65	2005
Boolean formulas and frequent sets	1	0.36	2004
Geometric and combinatorial tiles in 0-1 data	34	1.53	2004
Relational link-based ranking	39	3.15	2004
Finding recurrent sources in sequences	26	3.45	2003
Discovering all most specific sentences	120	4.14	2003
Mixture Models and Frequent Sets: Combining Global and Local Methods for 0-1 Data	10	0.69	2003
An MDL method for finding haplotype blocks and for estimating the strength of haplotype block boundaries.	31	4.01	2003
Rule Discovery and Probabilistic Modeling for Onomastic Data	3	0.52	2003
A Simple Algorithm for Topic Identification in 0-1 Data	12	1.30	2003
Genome segmentation using piecewise constant intensity models and reversible jump MCMC.	9	0.87	2002
Proceedings of the Second SIAM International Conference on Data Mining, Arlington, VA, USA, April 11-13, 2002	34	13.06	2002
Emerging scientific applications in data mining	26	1.24	2002
A Theory of Inductive Query Answering	51	2.04	2002
Long-range control of expression in yeast.	2	0.82	2002
Principles of Data Mining and Knowledge Discovery, 6th European Conference, PKDD 2002, Helsinki, Finland, August 19-23, 2002, Proceedings	40	6.03	2002
A Kernel Approach for Learning from almost Orthogonal Patterns	18	1.92	2002
Local and Global Methods in Data Mining: Basic Techniques and Open Problems	49	2.05	2002
Finding simple intensity descriptions from event sequence data	12	2.47	2001
Time Series Segmentation for Context Recognition in Mobile Devices	116	10.89	2001
Probabilistic modeling of transaction data with applications to profiling, visualization, and prediction	29	2.03	2001
Decomposition of Event Sequences into Independent Components	16	3.27	2001
Combining Discrete Algorithmic and Probabilistic Approaches in Data Mining	3	0.61	2001
Finding similar situations in sequences of events via random projections	5	0.46	2001

1
2
50 / page