Goto

Collaborating Authors

 Nearest Neighbor Methods


Parallelizing Instance-Based Data Classifiers

AAAI Conferences

In the age of BigData, producing results quickly while operating over vast volumes of data has become a vital requirement for data mining and machine learning applications to a degree that traditional serial algorithms can no longer keep up with these constraints. This paper applies different forms of parallelization techniques to popular instance-based classifiers–namely, a special form of naive Bayes and k-nearest neighbors–in an attempt to compare performance and make broad conclusions applicable to instance-based classifiers. Overall, our experimental results strongly indicate that parallelism over test instances provides the most speedup in most cases compared to other forms of parallelism.


EigenTransitions with Hypothesis Testing: The Anatomy of Urban Mobility

AAAI Conferences

Identifying the patterns in urban mobility is important for a variety of tasks such as transportation planning, urban resource allocation, emergency planning etc. This is evident from the large body of research on the topic, which has exploded with the vast amount of geo-tagged user-generated content from online social media. However, most of the existing work focuses on a specific setting, taking a statistical approach to describe and model the observed patterns. On the contrary in this work we introduce EigenTransitions, a spectrum-based, generic framework for analyzing spatio-temporal mobility datasets. EigenTransitions capture the anatomy of the aggregate and/or individuals’ mobility as a compact set of latent mobility patterns. Using a large corpus of geo-tagged content collected from Twitter, we utilize EigenTransitions to analyze the structure of urban mobility. In particular, we identify the EigenTransitions of a flow network between urban areas and derive hypothesis testing framework to evaluate urban mobility from both temporal and demographic perspectives. We further show how EigenTransitions not only identify latent mobility patterns, but also have the potential to support applications such as mobility prediction and inter-city comparisons. In particular, by identifying neighbors with similar latent mobility patterns and incorporating their historical transition behaviors, we proposed an EigenTransitions-based k-nearest neighbor algorithm, which can significantly improve the performance of individual mobility prediction. The proposed method is especially effective in “cold-start” scenarios where traditional methods are known to perform poorly.


Recognizing Snacks using SimpleCV

#artificialintelligence

This article aims to provide the basic knowledge of how to recognize snacks by using Python and SimpleCV. Readers will gain practical programming knowledge via experimentation with the Python scripts included in the Snack Classifier open source project. To illustrate with a snacks recognition app, the Snack Watcher watches any snacks present on the snack table. For Snack Watcher to determine if there was an interesting event, it needs to process the image into a set of image "Blobs". For each "Blob", Snack Watcher compares the "Blob" with it's previous state to determine if the "Blob" was added, removed or stationary.


K Nearest Neighbors Application - Practical Machine Learning Tutorial with Python p.14

#artificialintelligence

In the last part we introduced Classification, which is a supervised form of machine learning, and explained the K Nearest Neighbors algorithm intuition. In this tutorial, we're actually going to apply a simple example of the algorithm using Scikit-Learn, and then in the subsquent tutorials we'll build our own algorithm to learn more about how it works under the hood. To exemplify classification, we're going to use a Breast Cancer Dataset, which is a dataset donated to the University of California, Irvine (UCI) collection from the University of Wisconsin-Madison. UCI has a large Machine Learning Repository.


Clustering idea for very large datasets

@machinelearnbot

Let's say you have to cluster 10 million points, for instance keywords. So, in short, you can perform k-NN (k-nearest neighbors) clustering or some other types of clustering, which typically is O(n 2) or worse, from a computational complexity point of view. Has anyone ever used a clustering method based on sampling? The idea is to start by sampling 1% (or less) of the 100,000,000 entries, and perform clustering on these pairs of keywords, to create a "seed" or "baseline" cluster structure. The next step is to browse sequentially your 10,000,000 keywords, and for each keyword, find the closest cluster from the baseline cluster structure.


DIY Recommendation Engines for Mom and Pop Ecommerce Shops

#artificialintelligence

Of course we have all heard about machine learning and recommendation engines in big business ecommerce. For quite some time, massive ecommerce businesses like Netflix, Amazon, and Ebay have been leveraging the power of data science to improve customer service and boost sales. Where once this technology was cost-prohibitive to all but the major players, recently things have changed. Thanks to multi-channel ecommerce platforms like Shopify, and the developers who are building custom machine learning add-ons, now mom and pop online businesses get the chance to infuse their operations with the power of data science. In this article I introduce how machine learning algorithms work to produce recommendation systems for small business ecommerce.


Flattening the Density Gradient for Eliminating Spatial Centrality to Reduce Hubness

AAAI Conferences

Spatial centrality, whereby samples closer to the center of a dataset tend to be closer to all other samples, is regarded as one source of hubness. Hubness is well known to degrade k-nearest-neighbor (k-NN) classification. Spatial centrality can be removed by centering, i.e., shifting the origin to the global center of the dataset, in cases where inner product similarity is used. However, when Euclidean distance is used, centering has no effect on spatial centrality because the distance between the samples is the same before and after centering. As described in this paper, we propose a solution for the hubness problem when Euclidean distance is considered. We provide a theoretical explanation to demonstrate how the solution eliminates spatial centrality and reduces hubness. We then present some discussion of the reason the proposed solution works, from a viewpoint of density gradient, which is regarded as the origin of spatial centrality and hubness. We demonstrate that the solution corresponds to flattening the density gradient. Using real-world datasets, we demonstrate that the proposed method improves k-NN classification performance and outperforms an existing hub-reduction method.


Variable dimension data? • /r/MachineLearning

@machinelearnbot

You could do K-nearest neighbor's interpolation to give the empty 0 values a "guess" to how they would look like to the nearest neighbors. How well this would work is really just based on the properties of the data. If dimension k can be predicted by some association with a dimension j, and this relationship with k and j is fairly strong throughout the data, then it's worth trying. If it's all over the place, this hack won't help at all, perhaps it would even make very unreliable predictions.


Study Identifies Key Factors Associated With Dementia Pathogenesis

#artificialintelligence

Recent research has identified independent predictors of dementia to include age at diagnosis, transient ischemic attack and stroke status, and years of education, with vascular factors playing a greater role in disease pathogenesis than previously thought. The findings were presented at the 2016 annual meeting of the American Academy of Neurology (AAN). In the abstract, the researchers wrote that dementia encompasses a broad set of neurologic diseases, producing progressive declines in memory and/or thinking faculties, sometimes alongside personality and emotional disturbances. "Worldwide, approximately 35.6 million people have dementia, and this number is only expected to grow due to an aging population," they wrote. "Unfortunately, it is exceedingly difficult to predict who will develop dementia, let alone what type. This makes it difficult to mobilize various preventive strategies supported by mounting evidence."


Learning Vector Quantization for Machine Learning - Machine Learning Mastery

#artificialintelligence

A downside of K-Nearest Neighbors is that you need to hang on to your entire training dataset. The Learning Vector Quantization algorithm (or LVQ for short) is an artificial neural network algorithm that lets you choose how many training instances to hang onto and learns exactly what those instances should look like. In this post you will discover the Learning Vector Quantization algorithm. This post was written for developers and assumes no background in statistics or mathematics. The post focuses on how the algorithm works and how to use it for predictive modeling problems.