Ant Colony Optimization for Mining Gradual Patterns

• URL: http://arxiv.org/abs/2208.14795v1
• Date: Wed, 31 Aug 2022 12:22:57 GMT
• Title: Ant Colony Optimization for Mining Gradual Patterns
• Authors: Dickson Odhiambo Owuor and Thomas Runkler and Anne Laurent and Joseph Orero and Edmond Menya
• Abstract summary: A gradual dependency may take a form of "the more Attribute K, the less Attribute L" We propose an ant colony optimization technique that uses a probabilistic approach to learn and extract frequent gradual patterns.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Gradual pattern extraction is a field in (KDD) Knowledge Discovery in Databases that maps correlations between attributes of a data set as gradual dependencies. A gradual dependency may take a form of "the more Attribute K , the less Attribute L". In this paper, we propose an ant colony optimization technique that uses a probabilistic approach to learn and extract frequent gradual patterns. Through computational experiments on real-world data sets, we compared the performance of our ant-based algorithm to an existing gradual item set extraction algorithm and we found out that our algorithm outperforms the later especially when dealing with large data sets.

Related papers

• Equation discovery framework EPDE: Towards a better equation discovery [50.79602839359522]
  We enhance the EPDE algorithm -- an evolutionary optimization-based discovery framework. Our approach generates terms using fundamental building blocks such as elementary functions and individual differentials. We validate our algorithm's noise resilience and overall performance by comparing its results with those from the state-of-the-art equation discovery framework SINDy.
  arXiv  Detail & Related papers  (2024-12-28T15:58:44Z)
• Querying Easily Flip-flopped Samples for Deep Active Learning [63.62397322172216]
  Active learning is a machine learning paradigm that aims to improve the performance of a model by strategically selecting and querying unlabeled data. One effective selection strategy is to base it on the model's predictive uncertainty, which can be interpreted as a measure of how informative a sample is. This paper proposes the it least disagree metric (LDM) as the smallest probability of disagreement of the predicted label.
  arXiv  Detail & Related papers  (2024-01-18T08:12:23Z)
• Gram-Schmidt Methods for Unsupervised Feature Extraction and Selection [7.373617024876725]
  We propose a Gram-Schmidt process over function spaces to detect and map out nonlinear dependencies. We provide experimental results for synthetic and real-world benchmark datasets. Surprisingly, our linear feature extraction algorithms are comparable and often outperform several important nonlinear feature extraction methods.
  arXiv  Detail & Related papers  (2023-11-15T21:29:57Z)
• Influence of Swarm Intelligence in Data Clustering Mechanisms [0.0]
  Nature inspired Swarm based algorithms are used for data clustering to cope with larger datasets with lack and inconsistency of data. This paper reviews the performances of these new approaches and compares which is best for certain problematic situation.
  arXiv  Detail & Related papers  (2023-05-07T08:40:50Z)
• Linearized Wasserstein dimensionality reduction with approximation guarantees [65.16758672591365]
  LOT Wassmap is a computationally feasible algorithm to uncover low-dimensional structures in the Wasserstein space. We show that LOT Wassmap attains correct embeddings and that the quality improves with increased sample size. We also show how LOT Wassmap significantly reduces the computational cost when compared to algorithms that depend on pairwise distance computations.
  arXiv  Detail & Related papers  (2023-02-14T22:12:16Z)
• Dual Optimization for Kolmogorov Model Learning Using Enhanced Gradient Descent [8.714458129632158]
  Kolmogorov model (KM) is an interpretable and predictable representation approach to learning the underlying probabilistic structure of a set of random variables. We propose a computationally scalable KM learning algorithm, based on the regularized dual optimization combined with enhanced gradient descent (GD) method. It is shown that the accuracy of logical relation mining for interpretability by using the proposed KM learning algorithm exceeds $80%$.
  arXiv  Detail & Related papers  (2021-07-11T10:33:02Z)
• Capturing the temporal constraints of gradual patterns [0.0]
  Gradual pattern mining allows for extraction of attribute correlations through gradual rules such as: "the more X, the more Y" For instance, a researcher may apply gradual pattern mining to determine which attributes of a data set exhibit unfamiliar correlations in order to isolate them for deeper exploration or analysis. This work is motivated by the proliferation of IoT applications in almost every area of our society.
  arXiv  Detail & Related papers  (2021-06-28T06:45:48Z)
• Estimating leverage scores via rank revealing methods and randomization [50.591267188664666]
  We study algorithms for estimating the statistical leverage scores of rectangular dense or sparse matrices of arbitrary rank. Our approach is based on combining rank revealing methods with compositions of dense and sparse randomized dimensionality reduction transforms.
  arXiv  Detail & Related papers  (2021-05-23T19:21:55Z)
• Sparse PCA via $l_{2,p}$-Norm Regularization for Unsupervised Feature Selection [138.97647716793333]
  We propose a simple and efficient unsupervised feature selection method, by combining reconstruction error with $l_2,p$-norm regularization. We present an efficient optimization algorithm to solve the proposed unsupervised model, and analyse the convergence and computational complexity of the algorithm theoretically.
  arXiv  Detail & Related papers  (2020-12-29T04:08:38Z)
• New advances in enumerative biclustering algorithms with online partitioning [80.22629846165306]
  This paper further extends RIn-Close_CVC, a biclustering algorithm capable of performing an efficient, complete, correct and non-redundant enumeration of maximal biclusters with constant values on columns in numerical datasets. The improved algorithm is called RIn-Close_CVC3, keeps those attractive properties of RIn-Close_CVC, and is characterized by: a drastic reduction in memory usage; a consistent gain in runtime.
  arXiv  Detail & Related papers  (2020-03-07T14:54:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.