Information cartography in association rule mining

• URL: http://arxiv.org/abs/2003.00348v2
• Date: Fri, 16 Apr 2021 11:04:06 GMT
• Title: Information cartography in association rule mining
• Abstract summary: This study develops a method for automatic creation of metro maps of information obtained by Association Rule Mining. Visualizing the resulted metro maps not only justifies that this is a suitable tool for presenting structured knowledge hidden in data, but also that they can tell stories to users.
• Score: 2.535671322516818
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Association Rule Mining is a machine learning method for discovering the interesting relations between the attributes in a huge transaction database. Typically, algorithms for Association Rule Mining generate a huge number of association rules, from which it is hard to extract structured knowledge and present this automatically in a form that would be suitable for the user. Recently, an information cartography has been proposed for creating structured summaries of information and visualizing with methodology called "metro maps". This was applied to several problem domains, where pattern mining was necessary. The aim of this study is to develop a method for automatic creation of metro maps of information obtained by Association Rule Mining and, thus, spread its applicability to the other machine learning methods. Although the proposed method consists of multiple steps, its core presents metro map construction that is defined in the study as an optimization problem, which is solved using an evolutionary algorithm. Finally, this was applied to four well-known UCI Machine Learning datasets and one sport dataset. Visualizing the resulted metro maps not only justifies that this is a suitable tool for presenting structured knowledge hidden in data, but also that they can tell stories to users.

Related papers

• Large Multi-modal Model Cartographic Map Comprehension for Textual Locality Georeferencing [0.5120567378386615]
  Millions of biological sample records collected in the last few centuries archived in natural history collections are un-georeferenced.<n>We present preliminary experiments and results of a novel method that exploits multi-modal capabilities of recent Large Multi-Modal Models (LMM)<n>This method enables the model to visually contextualize spatial relations it reads in the locality description.
  arXiv  Detail & Related papers  (2025-07-11T13:23:25Z)
• Structure Learning via Mutual Information [0.8702432681310399]
  We propose a framework for learning and representing functional relationships in data using mutual information (MI) features. Our method aims to capture the underlying structure of information in datasets, enabling more efficient and generalizable learning algorithms.
  arXiv  Detail & Related papers  (2024-09-21T19:33:56Z)
• Topological Methods in Machine Learning: A Tutorial for Practitioners [4.297070083645049]
  Topological Machine Learning (TML) is an emerging field that leverages techniques from algebraic topology to analyze complex data structures. This tutorial provides a comprehensive introduction to two key TML techniques, persistent homology and the Mapper algorithm. To enhance accessibility, we adopt a data-centric approach, enabling readers to gain hands-on experience applying these techniques to relevant tasks.
  arXiv  Detail & Related papers  (2024-09-04T17:44:52Z)
• Masked Image Modeling: A Survey [73.21154550957898]
  Masked image modeling emerged as a powerful self-supervised learning technique in computer vision. We construct a taxonomy and review the most prominent papers in recent years. We aggregate the performance results of various masked image modeling methods on the most popular datasets.
  arXiv  Detail & Related papers  (2024-08-13T07:27:02Z)
• Boundary Detection Algorithm Inspired by Locally Linear Embedding [8.259071011958254]
  We propose a method for detecting boundary points inspired by the widely used locally linear embedding algorithm. We implement this method using two nearest neighborhood search schemes: the $epsilon$-radius ball scheme and the $K$-nearest neighbor scheme.
  arXiv  Detail & Related papers  (2024-06-26T16:05:57Z)
• Minimally Supervised Learning using Topological Projections in Self-Organizing Maps [55.31182147885694]
  We introduce a semi-supervised learning approach based on topological projections in self-organizing maps (SOMs) Our proposed method first trains SOMs on unlabeled data and then a minimal number of available labeled data points are assigned to key best matching units (BMU) Our results indicate that the proposed minimally supervised model significantly outperforms traditional regression techniques.
  arXiv  Detail & Related papers  (2024-01-12T22:51:48Z)
• Relation-aware Ensemble Learning for Knowledge Graph Embedding [68.94900786314666]
  We propose to learn an ensemble by leveraging existing methods in a relation-aware manner. exploring these semantics using relation-aware ensemble leads to a much larger search space than general ensemble methods. We propose a divide-search-combine algorithm RelEns-DSC that searches the relation-wise ensemble weights independently.
  arXiv  Detail & Related papers  (2023-10-13T07:40:12Z)
• Principled and Efficient Motif Finding for Structure Learning of Lifted Graphical Models [5.317624228510748]
  Structure learning is a core problem in AI central to the fields of neuro-symbolic AI and statistical relational learning. We present the first principled approach for mining structural motifs in lifted graphical models. We show that we outperform state-of-the-art structure learning approaches by up to 6% in terms of accuracy and up to 80% in terms of runtime.
  arXiv  Detail & Related papers  (2023-02-09T12:21:55Z)
• Integrating Semantics and Neighborhood Information with Graph-Driven Generative Models for Document Retrieval [51.823187647843945]
  In this paper, we encode the neighborhood information with a graph-induced Gaussian distribution, and propose to integrate the two types of information with a graph-driven generative model. Under the approximation, we prove that the training objective can be decomposed into terms involving only singleton or pairwise documents, enabling the model to be trained as efficiently as uncorrelated ones.
  arXiv  Detail & Related papers  (2021-05-27T11:29:03Z)
• Information Theoretic Meta Learning with Gaussian Processes [74.54485310507336]
  We formulate meta learning using information theoretic concepts; namely, mutual information and the information bottleneck. By making use of variational approximations to the mutual information, we derive a general and tractable framework for meta learning.
  arXiv  Detail & Related papers  (2020-09-07T16:47:30Z)
• A Survey on Deep Learning for Localization and Mapping: Towards the Age of Spatial Machine Intelligence [48.67755344239951]
  We provide a comprehensive survey, and propose a new taxonomy for localization and mapping using deep learning. A wide range of topics are covered, from learning odometry estimation, mapping, to global localization and simultaneous localization and mapping. It is our hope that this work can connect emerging works from robotics, computer vision and machine learning communities.
  arXiv  Detail & Related papers  (2020-06-22T19:01:21Z)

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.