نتایج جستجو برای: constrained clustering
تعداد نتایج: 178523 فیلتر نتایج به سال:
The area of clustering with constraints makes use of hints or advice in the form of constraints to aid or bias the clustering process. The most prevalent form of advice are conjunctions of pair-wise instance level constraints of the form must-link (ML) and cannot-link (CL) which state that pairs of instances should be in the same or different clusters respectively. Given a set of points P to cl...
Capturing application semantics and allowing a human analyst to express his focus in mining have been the motivation for several recent studies on constrained mining. In this paper, we introduce and study the problem of constrained clustering| nding clusters that satisfy certain user-speci ed constraints. We argue that this problem arises naturally in practice. Two types of constraints are disc...
When multiple data sources are available for clustering, an a priori data integration process is usually required. This process may be costly and may not lead to good clusterings, since important information is likely to be discarded. In this paper we propose constrained clustering as a strategy for integrating data sources without losing any information. It basically consists of adding the com...
In many segmentation applications, data objects are often clustered based purely on attribute-level similarities. This practice has neglected the useful information that resides in the link structure among data objects and the valuable expert domain knowledge about the desirable cluster assignment. Link structure can carry worthy information about the similarity between data objects (e.g. citat...
An unsupervised classification method for point events occurring on a geometric network is proposed. The idea relies the distributional flexibility and practicality of random partition models to discover clustering structure featuring observations from particular phenomenon taking place given set edges. By incorporating spatial effect in distribution, induced by Dirichlet process, one able cont...
This work focuses on the active selection of pairwise constraints for spectral clustering. We develop and analyze a technique for Active Constrained Clustering by Examining Spectral eigenvectorS (ACCESS) derived from a similarity matrix. The ACCESS method uses an analysis based on the theoretical properties of spectral decomposition to identify data items that are likely to be located on the bo...
using greedy clustering method to solve capacitated location-routing problem with fuzzy demands abstract in this paper, the capacitated location routing problem with fuzzy demands (clrp_fd) is considered. in clrp_fd, facility location problem (flp) and vehicle routing problem (vrp) are observed simultaneously. indeed the vehicles and the depots have a predefined capacity to serve the customerst...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید