Goto

Collaborating Authors

Clustering


Machine Learning A-Z : Hands-On Python & R In Data Science

#artificialintelligence

Learn to create Machine Learning Algorithms in Python and R from two Data Science experts. And in this section we're talking about the K means clustering algorithm. And in this tutorial we're going to talk about the intuition behind Kamins. So Kamins is a algorithm that allows you to closter your data and as we will see it's a very convenient tool for discovering categories of groups in your data set that you wouldn't have otherwise thought of yourself. And in this section or in this specific tutorial we'll learn how to understand k means on an intuitive level and we'll see an example of Hardwick's.


8 ways to jump-start your machine learning

#artificialintelligence

Do you need to classify data or predict outcomes? Are you having trouble getting your machine learning project off the ground? There are a number of techniques available to help you achieve lift-off. Some of the eight methods discussed below will accelerate your machine learning process dramatically, while others will not only accelerate the process but also help you build a better model. Not all of these methods will be suitable for a given project, but the first one--exploratory data analysis--should never be left out.


Clustering Custom Data Using the K-Means Algorithm -- Python

#artificialintelligence

The K-Means clustering algorithm is an unsupervised learning algorithm meaning that it has no target labels. It is very tricky to choose the best "K" value. But one way of doing it is the elbow method. According to this method, the sum of squared error (SSE) is calculated for some values of "K". The SSE is the sum of the squared distance between each data point of cluster and its centroid.


Fully Explained BIRCH Clustering for Outliers with Python

#artificialintelligence

This algorithm is used to perform hierarchical clustering based on trees. These trees are called CFT i.e. The full form of BIRCH is Balanced Iterative Reducing Clusters using Hierarchies. The metric use in this cluster to measure the distance is Euclidean distance measurement. When we get a massive dataset and BIRCH is not fulfilling the requirement because of memory constraints of using the whole dataset then we should consider mini-batches of fixed size from the dataset to get reduced runtime.


Exemplars can Reciprocate Principal Components

arXiv.org Artificial Intelligence

This paper presents a clustering algorithm that is an extension of the Category Trees algorithm. Category Trees is a clustering method that creates tree structures that branch on category type and not feature. The development in this paper is to consider a secondary order of clustering that is not the category to which the data row belongs, but the tree, representing a single classifier, that it is eventually clustered with. Each tree branches to store subsets of other categories, but the rows in those subsets may also be related. This paper is therefore concerned with looking at that second level of clustering between the other category subsets, to try to determine if there is any consistency over it. It is argued that Principal Components may be a related and reciprocal type of structure, and there is an even bigger question about the relation between exemplars and principal components, in general. The theory is demonstrated using the Portugal Forest Fires dataset as a case study. The distributed nature of that dataset can artificially create the tree categories and the output criterion can also be determined in an automatic and arbitrary way, leading to a flexible and dynamic clustering mechanism.


Intra-Inter Camera Similarity for Unsupervised Person Re-Identification

arXiv.org Artificial Intelligence

Most of unsupervised person Re-Identification (Re-ID) works produce pseudo-labels by measuring the feature similarity without considering the distribution discrepancy among cameras, leading to degraded accuracy in label computation across cameras. This paper targets to address this challenge by studying a novel intra-inter camera similarity for pseudo-label generation. We decompose the sample similarity computation into two stage, i.e., the intra-camera and inter-camera computations, respectively. The intra-camera computation directly leverages the CNN features for similarity computation within each camera. Pseudo-labels generated on different cameras train the re-id model in a multi-branch network. The second stage considers the classification scores of each sample on different cameras as a new feature vector. This new feature effectively alleviates the distribution discrepancy among cameras and generates more reliable pseudo-labels. We hence train our re-id model in two stages with intra-camera and inter-camera pseudo-labels, respectively. This simple intra-inter camera similarity produces surprisingly good performance on multiple datasets, e.g., achieves rank-1 accuracy of 89.5% on the Market1501 dataset, outperforming the recent unsupervised works by 9+%, and is comparable with the latest transfer learning works that leverage extra annotations.


Forest Fire Clustering: Cluster-oriented Label Propagation Clustering and Monte Carlo Verification Inspired by Forest Fire Dynamics

arXiv.org Machine Learning

One Clustering methods group data points together of the powerful applications of this technology is to cluster and assign them group-level labels. However, it and categorize individual cells into cell types based on has been difficult to evaluate the confidence of genomic features, especially in detecting subtypes of cancer the clustering results. Here, we introduce a novel cells in molecularly targeted therapy (Saadatpour et al., method that could not only find robust clusters 2015). However, the presence of rare and unknown cell but also provide a confidence score for the labels types could go against previous assumptions about cellular of each data point. Specifically, we reformulated composition (Chen et al., 2018). Therefore, any prior assumption label-propagation clustering to model after about the data could bias the analysis and would forest fire dynamics. The method has only one fail to capture the nuances of rare and potentially influential parameter - a fire temperature term describing cell types. In addition, doublet or multiplet cell effect in how easily one label propagates from one node to single-cell sequencing occurs when two or more cells are the next. Through iteratively starting label propagations mistakenly sequenced and tagged as one cell (DePasquale through a graph, we can discover the et al., 2019; McGinnis et al., 2019; Bernstein et al., 2020).


Statistically-Robust Clustering Techniques for Mapping Spatial Hotspots: A Survey

arXiv.org Machine Learning

Mapping of spatial hotspots, i.e., regions with significantly higher rates or probability density of generating certain events (e.g., disease or crime cases), is a important task in diverse societal domains, including public health, public safety, transportation, agriculture, environmental science, etc. Clustering techniques required by these domains differ from traditional clustering methods due to the high economic and social costs of spurious results (e.g., false alarms of crime clusters). As a result, statistical rigor is needed explicitly to control the rate of spurious detections. To address this challenge, techniques for statistically-robust clustering have been extensively studied by the data mining and statistics communities. In this survey we present an up-to-date and detailed review of the models and algorithms developed by this field. We first present a general taxonomy of the clustering process with statistical rigor, covering key steps of data and statistical modeling, region enumeration and maximization, significance testing, and data update. We further discuss different paradigms and methods within each of key steps. Finally, we highlight research gaps and potential future directions, which may serve as a stepping stone in generating new ideas and thoughts in this growing field and beyond.


Unsupervised and self-adaptative techniques for cross-domain person re-identification

arXiv.org Artificial Intelligence

Person Re-Identification (ReID) across non-overlapping cameras is a challenging task and, for this reason, most works in the prior art rely on supervised feature learning from a labeled dataset to match the same person in different views. However, it demands the time-consuming task of labeling the acquired data, prohibiting its fast deployment, specially in forensic scenarios. Unsupervised Domain Adaptation (UDA) emerges as a promising alternative, as it performs feature-learning adaptation from a model trained on a source to a target domain without identity-label annotation. However, most UDA-based algorithms rely upon a complex loss function with several hyper-parameters, which hinders the generalization to different scenarios. Moreover, as UDA depends on the translation between domains, it is important to select the most reliable data from the unseen domain, thus avoiding error propagation caused by noisy examples on the target data -- an often overlooked problem. In this sense, we propose a novel UDA-based ReID method that optimizes a simple loss function with only one hyper-parameter and that takes advantage of triplets of samples created by a new offline strategy based on the diversity of cameras within a cluster. This new strategy adapts the model and also regularizes it, avoiding overfitting on the target domain. We also introduce a new self-ensembling strategy, in which weights from different iterations are aggregated to create a final model combining knowledge from distinct moments of the adaptation. For evaluation, we consider three well-known deep learning architectures and combine them for final decision-making. The proposed method does not use person re-ranking nor any label on the target domain, and outperforms the state of the art, with a much simpler setup, on the Market to Duke, the challenging Market1501 to MSMT17, and Duke to MSMT17 adaptation scenarios.


Beyond Linear Subspace Clustering: A Comparative Study of Nonlinear Manifold Clustering Algorithms

arXiv.org Artificial Intelligence

Subspace clustering is an important unsupervised clustering approach. It is based on the assumption that the high-dimensional data points are approximately distributed around several low-dimensional linear subspaces. The majority of the prominent subspace clustering algorithms rely on the representation of the data points as linear combinations of other data points, which is known as a self-expressive representation. To overcome the restrictive linearity assumption, numerous nonlinear approaches were proposed to extend successful subspace clustering approaches to data on a union of nonlinear manifolds. In this comparative study, we provide a comprehensive overview of nonlinear subspace clustering approaches proposed in the last decade. We introduce a new taxonomy to classify the state-of-the-art approaches into three categories, namely locality preserving, kernel based, and neural network based. The major representative algorithms within each category are extensively compared on carefully designed synthetic and real-world data sets. The detailed analysis of these approaches unfolds potential research directions and unsolved challenges in this field.