José Oncina

Orcid: 0000-0003-3009-7299

Affiliations:
  • University of Alicante, Spain


According to our database1, José Oncina authored at least 62 papers between 1990 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Adaptively Learning to Recognize Symbols in Handwritten Early Music.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2019

2017
An efficient approach for Interactive Sequential Pattern Recognition.
Pattern Recognit., 2017

Staff-line detection and removal using a convolutional neural network.
Mach. Vis. Appl., 2017

Computing the Expected Edit Distance from a String to a Probabilistic Finite-State Automaton.
Int. J. Found. Comput. Sci., 2017

Recognition of pen-based music notation with finite-state machines.
Expert Syst. Appl., 2017

2016
Music staff removal with supervised pixel classification.
Int. J. Document Anal. Recognit., 2016

Computing the Expected Edit Distance from a String to a PFA.
Proceedings of the Implementation and Application of Automata, 2016

2015
Clustering of Strokes from Pen-Based Music Notation: An Experimental Study.
Proceedings of the Pattern Recognition and Image Analysis - 7th Iberian Conference, 2015

2014
The most probable string: an algorithmic study.
J. Log. Comput., 2014

Dynamic Insertions in TLAESA Fast NN Search Algorithm.
Proceedings of the 22nd International Conference on Pattern Recognition, 2014

Recognition of Pen-Based Music Notation: The HOMUS Dataset.
Proceedings of the 22nd International Conference on Pattern Recognition, 2014

2013
Which Fast Nearest Neighbour Search Algorithm to Use?
Proceedings of the Pattern Recognition and Image Analysis - 6th Iberian Conference, 2013

Computing the Most Probable String with a Probabilistic Finite State Machine.
Proceedings of the 11th International Conference on Finite State Methods and Natural Language Processing, 2013

2012
A log square average case algorithm to make insertions in fast similarity search.
Pattern Recognit. Lett., 2012

Restructuring versus Non Restructuring Insertions in MDF Indexes.
Proceedings of the ICPRAM 2012, 2012

2011
A fast pivot-based indexing algorithm for metric spaces.
Pattern Recognit. Lett., 2011

Impact of the Initialization in Tree-Based Fast Similarity Search Techniques.
Proceedings of the Similarity-Based Pattern Recognition - First International Workshop, 2011

Finding the Most Probable String and the Consensus String: an Algorithmic Study.
Proceedings of the 12th International Conference on Parsing Technologies, 2011

Interactive Structured Output Prediction: Application to Chromosome Classification.
Proceedings of the Pattern Recognition and Image Analysis - 5th Iberian Conference, 2011

2010
Combining Elimination Rules in Tree-Based Nearest Neighbor Search Algorithms.
Proceedings of the Structural, 2010

A Constant Average Time Algorithm to Allow Insertions in the LAESA Fast Nearest Neighbour Search Index.
Proceedings of the 20th International Conference on Pattern Recognition, 2010

2009
Optimum algorithm to minimize human interactions in sequential Computer Assisted Pattern Recognition.
Pattern Recognit. Lett., 2009

Experimental Analysis of Insertion Costs in a Naïve Dynamic MDF-Tree.
Proceedings of the Pattern Recognition and Image Analysis, 4th Iberian Conference, 2009

2008
A Stochastic Approach to Median String Computation.
Proceedings of the Structural, 2008

A Pruning Rule Based on a Distance Sparse Table for Hierarchical Similarity Search Algorithms.
Proceedings of the Structural, 2008

SEDiL: Software for Edit Distance Learning.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2008

Using Multiplicity Automata to Identify Transducer Relations from Membership and Equivalence Queries.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2008

2007
A Tabular Pruning Rule in Tree-Based Fast Nearest Neighbor Search Algorithms.
Proceedings of the Pattern Recognition and Image Analysis, Third Iberian Conference, 2007

2006
Learning stochastic edit distance: Application in handwritten character recognition.
Pattern Recognit., 2006

Some approaches to improve tree-based nearest neighbour search algorithms.
Pattern Recognit., 2006

Using Learned Conditional Distributions as Edit Distance.
Proceedings of the Structural, 2006

Learning Multiplicity Tree Automata.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2006

2005
Testing Some Improvements of the Fukunaga and Narendra's Fast Nearest Neighbour Search Algorithm in a Spelling Task.
Proceedings of the Pattern Recognition and Image Analysis, Second Iberian Conference, 2005

2004
A New Classification Rule based on Nearest Neighbour Search.
Proceedings of the 17th International Conference on Pattern Recognition, 2004

Learning Stochastic Finite Automata.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2004

Identifying Left-Right Deterministic Linear Languages.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2004

2003
A modification of the LAESA algorithm for approximated k-NN classification.
Pattern Recognit. Lett., 2003

Extending Fast Nearest Neighbour Search Algorithms for Approximate k-NN Classification.
Proceedings of the Pattern Recognition and Image Analysis, First Iberian Conference, 2003

Approximate Nearest Neighbour Search with the Fukunaga and Narendra Algorithm and Its Application to Chromosome Classification.
Proceedings of the Progress in Pattern Recognition, 2003

Some Improvements in Tree Based Nearest Neighbour Search Algorithms.
Proceedings of the Progress in Pattern Recognition, 2003

Identification with Probability One of Stochastic Deterministic Linear Languages.
Proceedings of the Algorithmic Learning Theory, 14th International Conference, 2003

2002
Extending LAESA Fast Nearest Neighbour Algorithm to Find the k Nearest Neighbours.
Proceedings of the Structural, 2002

A Fast Approximated k-Median Algorithm.
Proceedings of the Structural, 2002

On Sufficient Conditions to Identify in the Limit Classes of Grammars from Polynomial Time and Data.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2002

Inferring Deterministic Linear Languages.
Proceedings of the Computational Learning Theory, 2002

2001
An approximate median search algorithm in non-metric spaces.
Pattern Recognit. Lett., 2001

Stochastic Inference of Regular Tree Languages.
Mach. Learn., 2001

2000
A Fast Approximately k -Nearest-Neighbour Search Algorithm for Classification Tasks.
Proceedings of the Advances in Pattern Recognition, Joint IAPR International Workshops SSPR 2000 and SPR 2000, [8th International Workshop on Structural and Syntactic Pattern Recognition, 3rd International Workshop on Statistical Techniques in Pattern Recognition], Alicante, Spain, August 30, 2000

1999
Learning deterministic regular grammars from stochastic samples in polynomial time.
RAIRO Theor. Informatics Appl., 1999

1998
Comparison of fast nearest neighbour classifiers for handwritten character recognition.
Pattern Recognit. Lett., 1998

Language understanding and subsequential transducer learning.
Comput. Speech Lang., 1998

The Data Driven Approach Applied to the OSTIA Algorithm.
Proceedings of the Grammatical Inference, 4th International Colloquium, 1998

1996
A fast branch & bound nearest neighbour classifier in metric spaces.
Pattern Recognit. Lett., 1996

The Cocke-Younger-Kasami algorithm for cyclic strings.
Proceedings of the 13th International Conference on Pattern Recognition, 1996

Using domain information during the learning of a subsequential transducer.
Proceedings of the Grammatical Inference: Learning Syntax from Sentences, 1996

Identification of DFA: data-dependent vs data-independent algorithms.
Proceedings of the Grammatical Inference: Learning Syntax from Sentences, 1996

1994
A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements.
Pattern Recognit. Lett., 1994

Learning Stochastic Regular Grammars by Means of a State Merging Method.
Proceedings of the Grammatical Inference and Applications, Second International Colloquium, 1994

1993
Learning Subsequential Transducers for Pattern Recognition Interpretation Tasks.
IEEE Trans. Pattern Anal. Mach. Intell., 1993

1992
Transducer learning in pattern recognition.
Proceedings of the 11th IAPR International Conference on Pattern Recognition, 1992

An algorithm for finding nearest neighbours in constant average time with a linear space complexity.
Proceedings of the 11th IAPR International Conference on Pattern Recognition, 1992

1990
Learning Locally Testable Languages in the Strict Sense.
Proceedings of the Algorithmic Learning Theory, First International Workshop, 1990


  Loading...