首页/论文/1908.06801

arXiv 1908.068012019-08-15cs.DBcs.LG

Towards Efficient Discriminative Pattern Mining in Hybrid Domains

Meijo University（名城大学）

Yoshitaka Kameya

备注：: This paper is an English version of the paper originally presented in the 17th Forum on Information Technology (FIT 2018), a Japanese domestic conference held during September 19-21, 2018

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

英文摘要相关论文

英文摘要：

Discriminative pattern mining is a data mining task in which we find patterns that distinguish transactions in the class of interest from those in other classes, and is also called emerging pattern mining or subgroup discovery. One practical problem in discriminative pattern mining is how to handle numeric values in the input dataset. In this paper, we propose an algorithm for discriminative pattern mining that can deal with a transactional dataset in a hybrid domain, i.e. the one that includes both symbolic and numeric values. We also show the execution results of a prototype implementation of the proposed algorithm for two standard benchmark datasets.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

A hybrid clustering algorithm for data mining

School of Computer Science & IT, Devi Ahilya Vishwavidyalaya（Devi Ahilya Vishwavidyalaya计算机科学与信息技术学院）

Data clustering is a process of arranging similar data into groups. A clustering algorithm partitions a data set into several groups such that the similarity within a group is better than among groups. In this paper a hybrid clustering algorithm based on K-mean and K-harmonic mean (KHM) is described. The proposed algorithm is tested on five different datasets. The research is focused on fast and accurate clustering. Its performance is compared with the traditional K-means & KHM algorithm. The result obtained from proposed hybrid algorithm is much better than the traditional K-mean & KHM algori…

2012-05-24cs.DBcs.LG

Discriminative Predicate Path Mining for Fact Checking in Knowledge Graphs

University of Notre Dame（圣母大学）

Traditional fact checking by experts and analysts cannot keep pace with the volume of newly created information. It is important and necessary, therefore, to enhance our ability to computationally determine whether some statement of fact is true or false. We view this problem as a link-prediction task in a knowledge graph, and present a discriminative path-based method for fact checking in knowledge graphs that incorporates connectivity, type information, and predicate interactions. Given a statement S of the form (subject, predicate, object), for example, (Chicago, capitalOf, Illinois), our a…

2016-04-15cs.AIcs.DBcs.IR

HybridMiner: Mining Maximal Frequent Itemsets Using Hybrid Database Representation Approach

FAST-National University of Computer and Emerging Sciences（FAST-国立计算机与新兴科学大学）

In this paper we present a novel hybrid (arraybased layout and vertical bitmap layout) database representation approach for mining complete Maximal Frequent Itemset (MFI) on sparse and large datasets. Our work is novel in terms of scalability, item search order and two horizontal and vertical projection techniques. We also present a maximal algorithm using this hybrid database representation approach. Different experimental results on real and sparse benchmark datasets show that our approach is better than previous state of art maximal algorithms.

2009-04-21cs.AIcs.DBcs.DS

Hybrid Data Mining Technique for Knowledge Discovery from Engineering Materials' Data sets

Studying materials informatics from a data mining perspective can be beneficial for manufacturing and other industrial engineering applications. Predictive data mining technique and machine learning algorithm are combined to design a knowledge discovery system for the selection of engineering materials that meet the design specifications. Predictive method-Naive Bayesian classifier and Machine learning Algorithm - Pearson correlation coefficient method were implemented respectively for materials classification and selection. The knowledge extracted from the engineering materials data sets is p…

2012-09-19cs.DB

使用混合Trie树的内存高效序列模式挖掘

Memory-Efficient Sequential Pattern Mining with Hybrid Tries

Warrington College of Business（沃顿商学院）；University of Florida（佛罗里达大学）；Tepper School of Business（泰珀商学院）；Carnegie Mellon University（卡内基梅隆大学）；Rotman School of Management（罗特曼管理学院）；University of Toronto（多伦多大学）

本文提出一种基于混合trie数据结构和相应挖掘算法的内存高效序列模式挖掘方法，有效解决了大型数据集的内存瓶颈，在中小型实例上内存和时间均显著改善，且在256GB内存下唯一可处理大型数据集。

2024-07-27cs.AIcs.DBcs.DS

挖掘负序列模式以改进病毒基因组特征表示和分类

Mining Negative Sequential Patterns to Improve Viral Genomic Feature Representation and Classification

College of Information Science and Technology, Jinan University, Guangzhou 510632, China（信息科学与技术学院，暨南大学，广州510632，中国）；College of Cyber Security, Jinan University, Guangzhou 510632, China（网络安全学院，暨南大学，广州510632，中国）

本文提出GeneNSPCla框架，通过挖掘RNA病毒基因组中的负序列模式提取判别性缺失特征，提升病毒分类准确性，实验表明在8种分类器中平均准确率提升24.75%。

2026-04-28cs.DBcs.LG

更多相关论文收起更多论文

Hybrid Microaggregation for Privacy-Preserving Data Mining

k-Anonymity by microaggregation is one of the most commonly used anonymization techniques. This success is owe to the achievement of a worth of interest tradeoff between information loss and identity disclosure risk. However, this method may have some drawbacks. On the disclosure limitation side, there is a lack of protection against attribute disclosure. On the data utility side, dealing with a real datasets is a challenging task to achieve. Indeed, the latter are characterized by their large number of attributes and the presence of noisy data, such that outliers or, even, data with missing v…

2018-12-04cs.CRcs.DBcs.IR

Contrast Pattern Mining: A Survey

Jinan University（暨南大学）；Pazhou Lab（琶洲实验室）；University of Illinois at Chicago（伊利诺伊大学芝加哥分校）

Contrast pattern mining (CPM) is an important and popular subfield of data mining. Traditional sequential patterns cannot describe the contrast information between different classes of data, while contrast patterns involving the concept of contrast can describe the significant differences between datasets under different contrast conditions. Based on the number of papers published in this field, we find that researchers' interest in CPM is still active. Since CPM has many research questions and research methods. It is difficult for new researchers in the field to understand the general situati…

2022-09-27cs.AIcs.DB

HANDY: A Hybrid Association Rules Mining Approach for Network Layer Discovery of Services for Mobile Ad hoc Network

National University of Computer and Emerging Sciences（国立计算机与新兴科学大学）；Hamdard University（哈姆达德大学）

Mobile Ad hoc Network (MANET) is an infrastructure-less network formed between a set of mobile nodes. The discovery of services in MANET is a challenging job due to the unique properties of network. In this paper, a novel service discovery framework called Hybrid Association Rules Based Network Layer Discovery of Services for Ad hoc Networks (HANDY) has been proposed. HANDY provides three major research contributions. At first, it adopts a cross-layer optimized design for discovery of services that is based on simultaneous discovery of services and corresponding routes. Secondly, it provides a…

2017-10-03cs.AIcs.DBcs.NI

DiffNodesets: An Efficient Structure for Fast Mining Frequent Itemsets

Mining frequent itemsets is an essential problem in data mining and plays an important role in many data mining applications. In recent years, some itemset representations based on node sets have been proposed, which have shown to be very efficient for mining frequent itemsets. In this paper, we propose DiffNodeset, a novel and more efficient itemset representation, for mining frequent itemsets. Based on the DiffNodeset structure, we present an efficient algorithm, named dFIN, to mining frequent itemsets. To achieve high efficiency, dFIN finds frequent itemsets using a set-enumeration tree wit…

2015-07-06cs.DBcs.DS

Characterizing Discriminative Patterns

Discriminative patterns are association patterns that occur with disproportionate frequency in some classes versus others, and have been studied under names such as emerging patterns and contrast sets. Such patterns have demonstrated considerable value for classification and subgroup discovery, but a detailed understanding of the types of interactions among items in a discriminative pattern is lacking. To address this issue, we propose to categorize discriminative patterns according to four types of item interaction: (i) driver-passenger, (ii) coherent, (iii) independent additive and (iv) syne…

2011-02-20cs.DBcs.ITmath.IT

A Survey of Parallel Sequential Pattern Mining

With the growing popularity of shared resources, large volumes of complex data of different types are collected automatically. Traditional data mining algorithms generally have problems and challenges including huge memory cost, low processing speed, and inadequate hard disk space. As a fundamental task of data mining, sequential pattern mining (SPM) is used in a wide variety of real-life applications. However, it is more complex and challenging than other pattern mining tasks, i.e., frequent itemset mining and association rule mining, and also suffers from the above challenges when handling t…

2019-04-05cs.DB

A Survey of Utility-Oriented Pattern Mining

The main purpose of data mining and analytics is to find novel, potentially useful patterns that can be utilized in real-world applications to derive beneficial knowledge. For identifying and evaluating the usefulness of different kinds of patterns, many techniques and constraints have been proposed, such as support, confidence, sequence order, and utility parameters (e.g., weight, price, profit, quantity, satisfaction, etc.). In recent years, there has been an increasing demand for utility-oriented pattern mining (UPM, or called utility mining). UPM is a vital task, with numerous high-impact …

2019-09-16cs.DB

Using Association Rules for Better Treatment of Missing Values

National University of Computer and Emerging Sciences（国家计算机与新兴科学大学）

The quality of training data for knowledge discovery in databases (KDD) and data mining depends upon many factors, but handling missing values is considered to be a crucial factor in overall data quality. Today real world datasets contains missing values due to human, operational error, hardware malfunctioning and many other factors. The quality of knowledge extracted, learning and decision problems depend directly upon the quality of training data. By considering the importance of handling missing values in KDD and data mining tasks, in this paper we propose a novel Hybrid Missing values Impu…

2009-04-21cs.AIcs.DBcs.DS