A new network-base high-level data classification methodology (Quipus) by modeling attribute-attribute interactions

• URL: http://arxiv.org/abs/2009.13511v1
• Date: Mon, 28 Sep 2020 17:58:12 GMT
• Title: A new network-base high-level data classification methodology (Quipus) by modeling attribute-attribute interactions
• Authors: Esteban Wilfredo Vilca Zu\~niga, Liang Zhao
• Abstract summary: We propose a new methodology for network building based on attribute-attribute interactions that do not require normalization. The current results show us that this approach improves the accuracy of the high-level classification algorithm based on betweenness.
• Score: 7.3810864598379755
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: High-level classification algorithms focus on the interactions between instances. These produce a new form to evaluate and classify data. In this process, the core is a complex network building methodology. The current methodologies use variations of kNN to produce these graphs. However, these techniques ignore some hidden patterns between attributes and require normalization to be accurate. In this paper, we propose a new methodology for network building based on attribute-attribute interactions that do not require normalization. The current results show us that this approach improves the accuracy of the high-level classification algorithm based on betweenness centrality.

Related papers

• Complex Networks for Pattern-Based Data Classification [1.0445957451908694]
  We present two network-based classification techniques utilizing unique measures derived from the Minimum Spanning Tree and Single Source Shortest Path. Compared to the existing classic high-level and machine-learning classification techniques, we have observed promising numerical results for our proposed approaches.
  arXiv  Detail & Related papers  (2025-02-25T18:36:02Z)
• Exact Recovery and Bregman Hard Clustering of Node-Attributed Stochastic Block Model [0.16385815610837165]
  This paper presents an information-theoretic criterion for the exact recovery of community labels. It shows how network and attribute information can be exchanged in order to have exact recovery. It also presents an iterative clustering algorithm that maximizes the joint likelihood.
  arXiv  Detail & Related papers  (2023-10-30T16:46:05Z)
• Activate and Reject: Towards Safe Domain Generalization under Category Shift [71.95548187205736]
  We study a practical problem of Domain Generalization under Category Shift (DGCS) It aims to simultaneously detect unknown-class samples and classify known-class samples in the target domains. Compared to prior DG works, we face two new challenges: 1) how to learn the concept of unknown'' during training with only source known-class samples, and 2) how to adapt the source-trained model to unseen environments.
  arXiv  Detail & Related papers  (2023-10-07T07:53:12Z)
• Domain Adaptive Nuclei Instance Segmentation and Classification via Category-aware Feature Alignment and Pseudo-labelling [65.40672505658213]
  We propose a novel deep neural network, namely Category-Aware feature alignment and Pseudo-Labelling Network (CAPL-Net) for UDA nuclei instance segmentation and classification. Our approach outperforms state-of-the-art UDA methods with a remarkable margin.
  arXiv  Detail & Related papers  (2022-07-04T07:05:06Z)
• Do We Really Need a Learnable Classifier at the End of Deep Neural Network? [118.18554882199676]
  We study the potential of learning a neural network for classification with the classifier randomly as an ETF and fixed during training. Our experimental results show that our method is able to achieve similar performances on image classification for balanced datasets.
  arXiv  Detail & Related papers  (2022-03-17T04:34:28Z)
• Active Weighted Aging Ensemble for Drifted Data Stream Classification [2.277447144331876]
  Concept drift destabilizes the performance of the classification model and seriously degrades its quality. The proposed method has been evaluated through computer experiments using both real and generated data streams. The results confirm the high quality of the proposed algorithm over state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-12-19T13:52:53Z)
• Attention-driven Graph Clustering Network [49.040136530379094]
  We propose a novel deep clustering method named Attention-driven Graph Clustering Network (AGCN) AGCN exploits a heterogeneous-wise fusion module to dynamically fuse the node attribute feature and the topological graph feature. AGCN can jointly perform feature learning and cluster assignment in an unsupervised fashion.
  arXiv  Detail & Related papers  (2021-08-12T02:30:38Z)
• Learning Hierarchical Graph Neural Networks for Image Clustering [81.5841862489509]
  We propose a hierarchical graph neural network (GNN) model that learns how to cluster a set of images into an unknown number of identities. Our hierarchical GNN uses a novel approach to merge connected components predicted at each level of the hierarchy to form a new graph at the next level.
  arXiv  Detail & Related papers  (2021-07-03T01:28:42Z)
• A Network-Based High-Level Data Classification Algorithm Using Betweenness Centrality [7.3810864598379755]
  We propose a pure network-based high-level classification technique that uses the betweenness centrality measure. We test this model in nine different real datasets and compare it with other nine traditional and well-known classification models.
  arXiv  Detail & Related papers  (2020-09-16T23:14:13Z)
• New complex network building methodology for High Level Classification based on attribute-attribute interaction [0.0]
  We propose a new methodology for network building based on attribute-attribute interactions that do not require normalization and capture the hidden patterns of the attributes. The current results show us that could be used to improve some current high-level techniques.
  arXiv  Detail & Related papers  (2020-09-14T21:58:33Z)
• Structured Graph Learning for Clustering and Semi-supervised Classification [74.35376212789132]
  We propose a graph learning framework to preserve both the local and global structure of data. Our method uses the self-expressiveness of samples to capture the global structure and adaptive neighbor approach to respect the local structure. Our model is equivalent to a combination of kernel k-means and k-means methods under certain condition.
  arXiv  Detail & Related papers  (2020-08-31T08:41:20Z)
• Class-Attentive Diffusion Network for Semi-Supervised Classification [27.433021864424266]
  Class-Attentive Diffusion Network (CAD-Net) is a graph neural network for semi-supervised classification. In this paper, we propose a new aggregation scheme that adaptively aggregates nodes probably of the same class among K-hop neighbors. Our experiments on seven benchmark datasets consistently demonstrate the efficacy of the proposed method.
  arXiv  Detail & Related papers  (2020-06-18T01:14:08Z)

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.