Tapio Elomaa

Orcid: 0000-0002-5230-0027

According to our database1, Tapio Elomaa authored at least 62 papers between 1990 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Overfitting NN loop-filters in video coding.
Proceedings of the IEEE International Conference on Visual Communications and Image Processing, 2023

2021
using multiple losses for accurate facial age estimation.
CoRR, 2021

2018
Hierarchical Clustering of High-Dimensional Data Without Global Dimensionality Reduction.
Proceedings of the Foundations of Intelligent Systems - 24th International Symposium, 2018

Feasibility of B2C Customer Relationship Analytics in the B2B Industrial Context.
Proceedings of the 26th European Conference on Information Systems: Beyond Digitization, 2018

2016
Integer Linear Programming-Based Scheduling for Transport Triggered Architectures.
ACM Trans. Archit. Code Optim., 2016

2015
Quality Measures for Improving Technology Trees.
Int. J. Comput. Games Technol., 2015

Augmenting Technology Trees: Automation and Tool Support.
Proceedings of the 7th International Conference on Games and Virtual Worlds for Serious Applications, 2015

2012
Multi-target regression with rule ensembles.
J. Mach. Learn. Res., 2012

2011
Special issue on data analysis methodologies for intelligent systems: guest editor's introduction.
J. Intell. Inf. Syst., 2011

2010
An Analysis of Relevance Vector Machine Regression.
Proceedings of the Advances in Machine Learning I: Dedicated to the Memory of Professor Ryszard S. Michalski, 2010

Covering Analysis of the Greedy Algorithm for Partial Cover.
Proceedings of the Algorithms and Applications, 2010

2009
A Walk from 2-Norm SVM to 1-Norm SVM.
Proceedings of the ICDM 2009, 2009

2008
The cost of offline binary search tree algorithms and the complexity of the request sequence.
Theor. Comput. Sci., 2008

Reducing Splaying by Taking Advantage of Working Sets.
Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

Ranking the Uniformity of Interval Pairs.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2008

Maintaining Optimal Multi-way Splits for Numerical Attributes in Data Streams.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2008

Obtaining Low-Arity Discretizations from Online Data Streams.
Proceedings of the Foundations of Intelligent Systems, 17th International Symposium, 2008

Unsupervised Classifier Selection Based on Two-Sample Test.
Proceedings of the Discovery Science, 11th International Conference, 2008

2007
Improved Algorithms for Univariate Discretization of Continuous Features.
Proceedings of the Knowledge Discovery in Databases: PKDD 2007, 2007

Following the Perturbed Leader to Gamble at Multi-armed Bandits.
Proceedings of the Algorithmic Learning Theory, 18th International Conference, 2007

2006
Practical Approximation of Optimal Multivariate Discretization.
Proceedings of the Foundations of Intelligent Systems, 16th International Symposium, 2006

Poketree: A Dynamically Competitive Data Structure with Good Worst-Case Performance.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

A Voronoi Diagram Approach to Autonomous Clustering.
Proceedings of the Discovery Science, 9th International Conference, 2006

2005
On look-ahead and pathology in decision tree learning.
J. Exp. Theor. Artif. Intell., 2005

On Autonomous k-Means Clustering.
Proceedings of the Foundations of Intelligent Systems, 15th International Symposium, 2005

Approximation Algorithms for Minimizing Empirical Error by Axis-Parallel Hyperplanes.
Proceedings of the Machine Learning: ECML 2005, 2005

On Following the Perturbed Leader in the Bandit Setting.
Proceedings of the Algorithmic Learning Theory, 16th International Conference, 2005

2004
Selective Rademacher Penalization and Reduced Error Pruning of Decision Trees.
J. Mach. Learn. Res., 2004

Efficient Multisplitting Revisited: Optima-Preserving Elimination of Partition Candidates.
Data Min. Knowl. Discov., 2004

The Difficulty of Reduced Error Pruning of Leveled Branching Programs.
Ann. Math. Artif. Intell., 2004

2003
Flexible view recognition for indoor navigation based on Gabor filters and support vector machines.
Pattern Recognit., 2003

Necessary and Sufficient Pre-processing in Numerical Range Discretization.
Knowl. Inf. Syst., 2003

Reduced Error Pruning of branching programs cannot be approximated to within a logarithmic factor.
Inf. Process. Lett., 2003

On Decision Boundaries of Naïve Bayes in Continuous Domains.
Proceedings of the Knowledge Discovery in Databases: PKDD 2003, 2003

On Lookahead Heuristics in Decision Tree Learning.
Proceedings of the Foundations of Intelligent Systems, 14th International Symposium, 2003

Rademacher Penalization over Decision Tree Prunings.
Proceedings of the Machine Learning: ECML 2003, 2003

2002
Linear-Time Preprocessing in Optimal Numerical Range Partitioning.
J. Intell. Inf. Syst., 2002

Partition-Refining Algorithms for Learning Finite State Automata.
Proceedings of the Foundations of Intelligent Systems, 13th International Symposium, 2002

Fast Minimum Training Error Discretization.
Proceedings of the Machine Learning, 2002

Experiments with Projection Learning.
Proceedings of the Discovery Science, 5th International Conference, 2002

Progressive Rademacher Sampling.
Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002

2001
An Analysis of Reduced Error Pruning.
J. Artif. Intell. Res., 2001

On the Computational Complexity of Optimal Multisplitting.
Fundam. Informaticae, 2001

Robot Landmark Learning with SVMs.
Proceedings of the SCAI'01, 2001

Preprocessing Opportunities in Optimal Numerical Range Partitioning.
Proceedings of the 2001 IEEE International Conference on Data Mining, 29 November, 2001

On the Practice of Branching Program Boosting.
Proceedings of the Machine Learning: EMCL 2001, 2001

2000
On the Complexity of Optimal Multisplitting.
Proceedings of the Foundations of Intelligent Systems, 12th International Symposium, 2000

Generalizing Boundary Points.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1999
General and Efficient Multisplitting of Numerical Attributes.
Mach. Learn., 1999

Speeding Up the Search for Optimal Partitions.
Proceedings of the Principles of Data Mining and Knowledge Discovery, 1999

Predicting the Speed of Beer Fermentation in Laboratory and Industrial Scale.
Proceedings of the Engineering Applications of Bio-Inspired Artificial Neural Networks, 1999

The Biases of Decision Tree Pruning Strategies.
Proceedings of the Advances in Intelligent Data Analysis, Third International Symposium, 1999

1998
A Review of How the Mind Works.
AI Mag., 1998

Postponing the Evaluation of Attributes with a High Number of Boundary Points.
Proceedings of the Principles of Data Mining and Knowledge Discovery, 1998

1997
On the Well-Behavedness of Important Attribute Evaluation Functions.
Proceedings of the Sixth Scandinavian Conference on Artificial Intelligence, 1997

Efficient Multisplitting on Numerical Data.
Proceedings of the Principles of Data Mining and Knowledge Discovery, 1997

Well-Behaved Evaluation Functions for Numerical Attributes.
Proceedings of the Foundations of Intelligent Systems, 10th International Symposium, 1997

1995
TELA: A Platform for Experimenting with Attribute-based Learning Programs.
Proceedings of the Fifth Scandinavian Conference on Artificial Intelligence, 1995

1994
In Defense of C4.5: Notes in Learning One-Level Decision Trees.
Proceedings of the Machine Learning, 1994

A Geometric Approach to Feature Selection.
Proceedings of the Machine Learning: ECML-94, 1994

1991
Extending the learnability of decision trees.
Proceedings of the Third International Conference on Tools for Artificial Intelligence, 1991

1990
On inducing topologically minimal decision trees.
Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence, 1990


  Loading...