Constrained Clustering: Effective Constraint Propagation with Imperfect Oracles

Abstract—While spectral clustering is usually an unsuper-vised operation, there are circumstances in which we have prior belief that pairs of samples should (or should not) be assigned with the same cluster. Constrained spectral clustering aims to exploit this prior belief as constraint (or weak supervision) to influence the cluster formation so as to obtain a structure more closely resembling human perception. Two important issues re-main open: (1) how to propagate sparse constraints effectively, (2) how to handle ill-conditioned/noisy constraints generated by imperfect oracles. In this paper we present a unified framework to address the above issues. Specifically, in contrast to existing constrained spectral clustering approaches that blindly rely on all features for constructing the spectral, our approach searches for neighbours driven by discriminative feature selection for more effective constraint diffusion. Crucially, we formulate a novel data-driven filtering approach to handle the noisy constraint problem, which has been unrealistically ignored in constrained spectral clustering literature. Keywords-Constrained clustering, constraint propagation, feature selection, imperfect oracles, spectral clustering. I

Condensation and Clustering in the Driven Pair Exclusion Process

We investigate particle condensation in a driven pair exclusion process on one- and two- dimensional lattices under the periodic boundary condition. The model describes a biased hopping of particles subject to a pair exclusion constraint that each particle cannot stay at a same site with its pre-assigned partner. The pair exclusion causes a mesoscopic condensation characterized by the scaling of the condensate size $m_{\rm con}\sim N^\beta$ and the number of condensates $N_{\rm con}\sim N^\alpha$ with the total number of sites $N$. Those condensates are distributed randomly without hopping bias. We find that the hopping bias generates a spatial correlation among condensates so that a cluster of condensates appears. Especially, the cluster has an anisotropic shape in the two-dimensional system. The mesoscopic condensation and the clustering are studied by means of numerical simulations.Comment: 4 pages, 5 figure

A simple state-based prognostic model for filter clogging

In today's maintenance planning, fuel filters are replaced or cleaned on a regular basis. Monitoring and implementation of prognostics on filtration system have the potential to avoid costs and increase safety. Prognostics is a fundamental technology within Integrated Vehicle Health Management (IVHM). Prognostic models can be categorised into three major categories: 1) Physics-based models 2) Data-driven models 3) Experience-based models. One of the challenges in the progression of the clogging filter failure is the inability to observe the natural clogging filter failure due to time constraint. This paper presents a simple solution to collect data for a clogging filter failure. Also, it represents a simple state-based prognostic with duration information (SSPD) method that aims to detect and forecast clogging of filter in a laboratory based fuel rig system. The progression of the clogging filter failure is created unnaturally. The degradation level is divided into several groups. Each group is defined as a state in the failure progression of clogging filter. Then, the data is collected to create the clogging filter progression states unnaturally. The SSPD method consists of three steps: clustering, clustering evaluation, and remaining useful life (RUL) estimation. Prognosis results show that the SSPD method is able to predicate the RUL of the clogging filter accurately

Semi-supervised spectral clustering with automatic propagation of pairwise constraints

International audienceIn our data driven world, clustering is of major importance to help end-users and decision makers understanding information structures. Supervised learning techniques rely on ground truth to perform the classification and are usually subject to overtraining issues. On the other hand, unsupervised clustering techniques study the structure of the data without disposing of any training data. Given the difficulty of the task, unsupervised learning tends to provide inferior results to supervised learning. To boost their performance, a compromise is to use learning only for some of the ambiguous classes. In this context, this paper studies the impact of pairwise constraints to unsupervised Spectral Clustering. We introduce a new generalization of constraint propagation which maximizes partitioning quality while reducing annotation costs. Experiments show the efficiency of the proposed scheme