Pattern Inversion as a Pattern Recognition Method for Machine Learning
Alexei Mikhailov, Mikhail Karavay

TL;DR
This paper introduces a pattern inversion method for pattern recognition that enables instant, coefficients-free learning using indexing-based techniques, offering an alternative to traditional neural networks.
Contribution
It proposes a novel pattern inversion formalism and transform for unsupervised instant learning, replacing deep learning coefficients with inverse patterns in indexing methods.
Findings
Supports view-angle independent recognition of 3D objects
Enables almost instantaneous learning without coefficients
Demonstrates applications in predicting aircraft engine life
Abstract
Artificial neural networks use a lot of coefficients that take a great deal of computing power for their adjustment, especially if deep learning networks are employed. However, there exist coefficients-free extremely fast indexing-based technologies that work, for instance, in Google search engines, in genome sequencing, etc. The paper discusses the use of indexing-based methods for pattern recognition. It is shown that for pattern recognition applications such indexing methods replace with inverse patterns the fully inverted files, which are typically employed in search engines. Not only such inversion provide automatic feature extraction, which is a distinguishing mark of deep learning, but, unlike deep learning, pattern inversion supports almost instantaneous learning, which is a consequence of absence of coefficients. The paper discusses a pattern inversion formalism that makes use…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
