An Improved Cop-Kmeans Clustering for Solving Constraint Violation Based on MapReduce Framework

No abstract is available for this paper.

• Publication year

  2013

• Venue

  Fundamenta Informaticae

• Publication date

  2013-09-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.3233/FI-2013-883
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Parallelized Computing of Attribute Core Based on Rough Set Theory and MapReduce

  2012cited by this paper
• A Modified k-means Algorithm for Clustering Problem with Balancing Constraints

  2011cited by this paper
• A Modified Cop-Kmeans Algorithm Based on Sequenced Cannot-Link Set

  2011influential reference
• K-Means Clustering with Bagging and MapReduce

  2011cited by this paper
• A Parallel Cop-Kmeans Clustering Algorithm Based on MapReduce Framework

  2011influential reference
• Clustering with Attribute-Level Constraints

  2011cited by this paper
• AN IMPROVED COP-KMEANS ALGORITHM FOR SOLVING CONSTRAINT VIOLATION

  2010influential reference
• Parallel K-Means Clustering Based on MapReduce

  2009cited by this paper
• Hadoop: The Definitive Guide

  2009cited by this paper
• A Novel Multimodal Probability Model for Cluster Analysis

  2009cited by this paper
• Semi-GAPS: A Semi-supervised Clustering Method Using Point Symmetry

  2009cited by this paper
• 3DM: Domain-oriented Data-driven Data Mining

  2009cited by this paper
• Clustering Large Databases in Distributed Environment

  2009cited by this paper
• MapReduce: simplified data processing on large clusters

  2008cited by this paper
• A Semi-supervised Clustering Algorithm Based on Must-Link Set

  2008cited by this paper
• A Survey of Clustering with Instance Level Constraints 1 2

  2007cited by this paper
• An aggregated clustering approach using multi-ant colonies algorithms

  2006cited by this paper
• Identifying and Generating Easy Sets of Constraints for Clustering

  2006influential reference
• CLUSTERING: LARGE DATABASES

  2006cited by this paper
• The Study of Parallel K-Means Algorithm

  2006cited by this paper
• Clustering with Constraints: Feasibility Issues and the k-Means Algorithm

  2005cited by this paper
• Active Semi-Supervision for Pairwise Constrained Clustering

  2004cited by this paper
• Distance Metric Learning with Application to Clustering with Side-Information

  2002cited by this paper
• Semi-supervised Clustering by Seeding

  2002cited by this paper
• Intelligent Clustering with Instance-Level Constraints

  2002cited by this paper
• Constrained K-means Clustering with Background Knowledge

  2001influential reference
• Constraint-based clustering in large databases

  2001cited by this paper
• Clustering with Instance-Level Constraints

  2000cited by this paper
• A Fast Parallel Clustering Algorithm for Large Spatial Databases

  1999cited by this paper
• Introduction to graph theory

  1973cited by this paper

• Personalized Clustering via Targeted Representation Learning

  2024cites this paper
• Semi-supervised deep embedded clustering with pairwise constraints and subset allocation

  2023cites this paper
• Knowledge augmentation-based soft constraints for semi-supervised clustering

  2023cites this paper
• Multi-Stream Extension of Variational Bayesian HMM Clustering (MS-VBx) for Combined End-to-End and Vector Clustering-based Diarization

  2023cites this paper
• scSSA: A clustering method for single cell RNA-seq data based on semi-supervised autoencoder.

  2022cites this paper
• Evaluation of Unsupervised Learning Modeling with Parallel Processes

  2022cites this paper
• Online Neural Diarization of Unlimited Numbers of Speakers Using Global and Local Attractors

  2022cites this paper
• Adaptive and structured graph learning for semi-supervised clustering

  2022cites this paper
• Towards Neural Diarization for Unlimited Numbers of Speakers Using Global and Local Attractors

  2021cites this paper
• An Efficient Algorithm Combining Spectral Clustering with Feature Selection

  2020cites this paper
• Research Challenges and Technology Progress of Data Mining with Bigdata

  2019cites this paper
• Research Progress on Semi-Supervised Clustering

  2019cites this paper
• PUMA: Parallel subspace clustering of categorical data using multi-attribute weights

  2019cites this paper
• Parallel Hierarchical Subspace Clustering of Categorical Data

  2019cites this paper
• Mutual kNN based spectral clustering

  2018cites this paper
• Short-term load forecasting with clustering–regression model in distributed cluster

  2017cites this paper
• Joint Constrained Clustering and Feature Learning based on Deep Neural Networks

  2017cites this paper
• Big Data with Cloud Computing: an insight on the computing environment, MapReduce, and programming frameworks

  2014influential citation
• Hybridization of the Gravitational Search Algorithm and Big Bang-Big Crunch Algorithm for Data Clustering

  2013cites this paper