• Home
  • Search
  • Clustering high dimensional sparse transactional data with constraints
  • Cite Icon7
  • https://doi.org/10.1109/grc.2006.1635896Copy DOI Icon

Clustering high dimensional sparse transactional data with constraints

  • May 10, 2006
  • Yanrong Li +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

In this paper, we propose an incremental clustering algorithm called INCLUS for high dimensional sparse transactional data using a newly defined similarity measure and a notion of cluster representatives based on locally frequent items of each cluster. INCLUS seeks structures in transactional data with respect to the support and similarity constraints specified by the users. The effectiveness and the order-independence property of INCLUS are empirically studied and compared with two state- of-art algorithms. Though it is a one-pass algorithm without any iterative refinement, INCLUS is not only effective and scalable, but also insensitive to the order of transactions, which is a crucial property for an incremental algorithm. globally frequent items are neglected during clustering, clusters embedded in such transactions cannot be discovered. In this paper, we define a new notion of cluster representative based on frequent items within each cluster that is easy to comprehend by users, and introduce a new similarity measure especially suitable for sparse transactional data. Using these, an incremental clustering algorithm INCLUS is proposed to cope with high cardinality of transactional datasets. INCLUS is a structure seeking algorithm as it produces clusters based on the support and similarity constraints specified by the users. The domains of input parameters (support and similarity thresholds) are well defined and can be easily chosen by users. INCLUS is significantly different from LargeItem, SUMMARY and TrK-Means which also employ frequent items for clustering. LargeItem uses global optimization to minimize both overlapping of frequent items among clusters and the number of infrequent items for a clustering. INCLUS uses frequent items for local optimization such that similarities for a clustering are maximized with respect to the similarity constraints. In SUMMARY, the frequent items used are globally frequent in the whole data set while in INCLUS they are only locally frequent within a cluster. Unlike INCLUS, TrK-Means does not use similarity constraints and it produces k or more clusters based on the user input of k. Squeezer (7) is an incremental clustering algorithm for categorical data. It uses a different similarity function from INCLUS, which is defined as the number of matched attribute values in a pair of tuples.

Similar Papers
  • Book Chapter
  • Citations1

Sparse Stochastic Online AUC Optimization for Imbalanced Streaming Data

  • Jan 01, 2018
  • Min Yang +4
  • Research Article
  • Citations36

Fuzzy partition based soft subspace clustering and its applications in high dimensional data

  • May 28, 2013
  • Information Sciences
  • Jun Wang +3
  • Research Article
  • Citations3

Regularized Stacked Autoencoder with Dropout-Layer to Overcome Overfitting in Numerical High-Dimensional Sparse Data

  • May 06, 2025
  • Journal of Advanced Research Design
  • Abdussamad Abdussamad +6
  • Conference Article
  • Citations5

Dynamic and Incremental Clustering Based on Density Reachable

  • Jan 01, 2009
  • Yu-Chen Song +4
  • Research Article
  • Citations5

Research on a Train Safety Driving Method Based on Fusion of an Incremental Clustering Algorithm and Lightweight Shared Convolution.

  • Jul 30, 2024
  • Sensors (Basel, Switzerland)
  • Hongping Wang +5
  • Research Article
  • Citations1

An Improved Jaccard Coefficient‐Based Clustering Approach with Application to Diagnosis and RUL Estimation

  • Jan 01, 2024
  • IET Signal Processing
  • Xiaoqing Li +4
  • Research Article
  • Citations8

A big data exploration approach to exploit in-vehicle data for smart road maintenance

  • Aug 09, 2023
  • Future Generation Computer Systems
  • Devis Bianchini +2
  • Book Chapter
  • Citations5

An Incremental Clustering Algorithm Based on Compact Sets with Radius α

  • Jan 01, 2005
  • Aurora Pons-Porrata +3
  • Research Article
  • Citations2

Enhanced Clustering Algorithm for Processing Online Data

  • Jan 01, 2013
  • IOSR Journal of Computer Engineering
  • Ankita Choubey
  • Research Article
  • Citations3

Research on Weibo Hotspot Finding Based on Self-Adaptive Incremental Clustering

  • Jun 01, 2019
  • Journal of Shanghai Jiaotong University (Science)
  • Huilin Song +3
  • Conference Article

Incremental Text Clustering Algorithm For Cloud-Based Data Management In Scientific Research Papers

  • Jul 18, 2022
  • Mahfuja Nilufar +1
  • Research Article
  • Citations2

Matrix Factorization and Prediction for High-Dimensional Co-Occurrence Count Data via Shared Parameter Alternating Zero Inflated Gamma Model

  • Oct 27, 2024
  • Mathematics
  • Taejoon Kim +1
  • Research Article
  • Citations34

Directional co-clustering

  • Apr 30, 2018
  • Advances in Data Analysis and Classification
  • Aghiles Salah +1
  • Research Article
  • Citations8

X-DMM: Fast and Scalable Model Based Text Clustering

  • Jul 17, 2019
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • Linwei Li +4
  • Research Article
  • Citations117

An intelligent system for mineral identification in thin sections based on a cascade approach

  • Nov 03, 2016
  • Computers & Geosciences
  • Hossein Izadi +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.