Non-autoregressive (NAR) models can generate sentences with less computation than autoregressive models but sacrifice generation quality. Previous studies addressed this issue through iterative decoding. This study proposes using nearest neighbors as the initial state of an NAR decoder and editing them iteratively. We present a novel training strategy to learn the edit operations on neighbors to improve NAR text generation. Experimental results show that the proposed method (NeighborEdit) achieves higher translation quality (1.69 points higher than the vanilla Transformer) with fewer decoding iterations (one-eighteenth fewer iterations) on the JRC-Acquis En-De dataset, the common benchmark dataset for machine translation using nearest neighbors. We also confirm the effectiveness of the proposed method on a data-to-text task (WikiBio). In addition, the proposed method outperforms an NAR baseline on the WMT'14 En-De dataset. We also report analysis on neighbor examples used in the proposed method.

Watch the AAAI ask me anything videos, which cover topics from case-based reasoning to AI ethics to AI and education.

In the AI-driven era, customer service has evolved to be more efficient and self-learning. AI systems help companies in a variety of ways including improving customer satisfaction ratings, reducing operational costs, and increasing revenue. AI has many other advantages for customer service that human agents cannot compete with -- it is always available, 24/7 and never gets tired or distracted. One of the leading AI systems in this area is CBR Systems' machine learning help desk system. Case Based Reasoning (CBR) is an AI technique that is increasingly used by customer service departments to improve their performance and help desk software providers to offer even more intelligent solutions for their customers.

K-nearest neighbors (KNN) is a type of supervised learning machine learning algorithm and can be used for both regression and classification tasks. A supervised machine learning algorithm is dependent on labeled input data which the algorithm learns on and uses its learnt knowledge to produce accurate outputs when unlabeled data is inputted. The use of KNN is to make predictions on the test data set based on the characteristics (labeled data) of the training data. The method used to make these predictions is by calculating the distance between the test data and training data, assuming that similar characteristics or attributes of the data points exist within close proximity. It allows us to identify and assign the category of the new data whilst taking into consideration its characteristics based on learned data points from the training data.

Signal Processing: Image Communication manuscript No. (will be inserted by the editor) Abstract While storing invoice content as metadata comparison of 9 AC per manually processed invoice and to avoid paper document processing may be the future 2 AC per automated processing of one invoice based on trend, almost all of daily issued invoices are still surveys in 2004 and 2003 respectively. A 2016 report by printed on paper or generated in digital formats such the Institute of Finance and Management [2] suggested as PDFs. In this paper, we introduce the OCRMiner that the average cost to process an invoice was $12.90. The system on Scanned Receipt OCR and Information Extraction is designed to process the document in a similar way a (SROIE) at ICDAR 2019 [3] or the Mobile-Captured human reader uses, i.e. to employ different layout and Image Document Recognition for Vietnamese Receipts text attributes in a coordinated decision. Still, annotated benchmark invoice consists of a set of interconnected modules that start datasets are not generally available due to confidential with (possibly erroneous) character-based output from information, and the published papers do not offer a standard OCR system and allow to apply different detailed dataset descriptions and error analyses of the techniques and to expand the extracted knowledge at content. Moreover, although receipts and invoices have each step. Using an open source OCR, the system is some common attributes, their analyses differ vastly able to recover the invoice data in 90% for English and due to complex graphical layouts and richer content in 88% for the Czech set. In 2006, Lewis et al. [6] published the IIT 1 Introduction Complex Document Information Processing Test Collection (IIT-CDIP) based on the Legacy Tobacco Documents Automatic invoice processing systems gain significant Library, containing roughly 40 millions scanned interest of large companies who deal with enormous pages for evaluation of document information processing numbers of invoices each day, due to not only their tasks.

Recently, Qiao, Duan, and Cheng~(2019) proposed a distributed nearest-neighbor classification method, in which a massive dataset is split into smaller groups, each processed with a $k$-nearest-neighbor classifier, and the final class label is predicted by a majority vote among these groupwise class labels. This paper shows that the distributed algorithm with $k=1$ over a sufficiently large number of groups attains a minimax optimal error rate up to a multiplicative logarithmic factor under some regularity conditions, for both regression and classification problems. Roughly speaking, distributed 1-nearest-neighbor rules with $M$ groups has a performance comparable to standard $\Theta(M)$-nearest-neighbor rules. In the analysis, alternative rules with a refined aggregation method are proposed and shown to attain exact minimax optimal rates.

Neural network embeddings are a low-dimensional representation of input data that give rise to a variety of applications. Embeddings have some interesting capabilities, as they are able to capture the semantics of the data points. This is especially useful for unstructured data like images and videos, so you can not only encode pixel similarities but also some more complex relationships. Performing searches over these embeddings gives rise to a lot of use cases like classification, building up the recommendation systems, or even anomaly detection. One of the primary benefits of performing a nearest neighbor search on embeddings to accomplish these tasks is that there is no need to create a custom network for every new problem, you can often just use pre-trained models.

Present air traffic complexity metrics are defined considering the interests of different management layers of ATM. These layers have different objectives which in practice compete to maximize their own goals, which leads to fragmented decision making. This fragmentation together with competing KPAs requires transparent and neutral air traffic information to pave the way for an explainable set of actions. In this paper, we introduce the concept of single aircraft complexity, to determine the contribution of each aircraft to the overall complexity of air traffic. Furthermore, we describe a methodology extending this concept to define complex communities, which are groups of interdependent aircraft that contribute the majority of the complexity in a certain airspace. In order to showcase the methodology, a tool that visualizes different outputs of the algorithm is developed. Through use-cases based on synthetic and real historical traffic, we first show that the algorithm can serve to formalize controller decisions as well as guide controllers to better decisions. Further, we investigate how the provided information can be used to increase transparency of the decision makers towards different airspace users, which serves also to increase fairness and equity. Lastly, a sensitivity analysis is conducted in order to systematically analyse how each input affects the methodology.

Technological innovation is increasing at a rapid pace and has made digital storage extremely cheap and accessible. Additionally, most people now have phones with cameras that are able to capture high quality images. The majority of images taken are viewed a few times and then sent to sit on a hard drive or some cloud storage service. I am no different, and since I had some extra time during the COVID-19 lockdowns, I came up with some software to give the photos in people's libraries a second life. This software creates photo mosaics.

K Nearest Neighbors or KNN is a standard Machine Learning algorithm used for classification. In KNN, we plot already labeled points with their label and then define decision boundaries based on the value of the hyperparameter "K". Hyperparameter just means a parameter that we control and can use for tuning. "K" is used to represent how many of the nearest neighbors we should take into account when determining the class of a new point. In this post we'll cover how to do KNN on two datasets, one contrived sample dataset and one more realistic dataset about wine from sklearn.