scholarly journals Frequent Pattern Mining and Current State of the Art

2011 ◽  
Vol 26 (7) ◽  
pp. 33-39 ◽  
Author(s):  
Kalli Srinivasa Nageswara Prasad ◽  
S. Ramakrishna
Keyword(s):  
Pattern Mining ◽  
State Of The Art ◽  
Frequent Pattern Mining ◽  
Frequent Pattern ◽  
Current State

Enhanced Frequent Itemsets Based on Topic Modeling in Information Filtering

2017 ◽  
Vol 5 (4) ◽  
pp. 33-43
Author(s):  
Than Than Wai ◽  
Sint Sint Aung
Keyword(s):  
Topic Modeling ◽  
Information Needs ◽  
Pattern Mining ◽  
Topic Model ◽  
State Of The Art ◽  
Information Filtering ◽  
Frequent Pattern Mining ◽  
Frequent Itemsets ◽  
Frequent Pattern ◽  
Proposed Model

In order to generate user's information needs from a collection of documents, many term-based and pattern-based approaches have been used in Information Filtering. In these approaches, the documents in the collection are all about one topic. However, user's interests can be diverse and the documents in the collection often involve multiple topics. Topic modeling is useful for the area of machine learning and text mining. It generates models to discover the hidden multiple topics in a collection of documents and each of these topics are presented by distribution of words. But its effectiveness in information filtering has not been so well explored. Patterns are always thought to be more discriminative than single terms for describing documents. The major challenge found in frequent pattern mining is a large number of result patterns. As the minimum threshold becomes lower, an exponentially large number of patterns are generated. To deal with the above mentioned limitations and problems, in this paper, a novel information filtering model, EFITM (Enhanced Frequent Itemsets based on Topic Model) model is proposed. Experimental results using the CRANFIELD dataset for the task of information filtering show that the proposed model outperforms over state-of-the-art models.

An Adaptive Data Distribution Through Tree Rules in Frequent Pattern Mining

2018 ◽  
pp. 300-305
Keyword(s):  
Information Sharing ◽  
Pattern Mining ◽  
Data Distribution ◽  
Frequent Pattern Mining ◽  
Frequent Pattern ◽  
General Development ◽  
Secure Information ◽  
Evaluation Parameters ◽  
Secure Information Sharing

Information sharing among the associations is a general development in a couple of zones like business headway and exhibiting. As bit of the touchy principles that ought to be kept private may be uncovered and such disclosure of delicate examples may impacts the advantages of the association that have the data. Subsequently the standards which are delicate must be secured before sharing the data. In this paper to give secure information sharing delicate guidelines are bothered first which was found by incessant example tree. Here touchy arrangement of principles are bothered by substitution. This kind of substitution diminishes the hazard and increment the utility of the dataset when contrasted with different techniques. Examination is done on certifiable dataset. Results shows that proposed work is better as appear differently in relation to various past strategies on the introduce of evaluation parameters.

Learning and Synchronized Privacy Preserving Frequent Pattern Mining

2011 ◽  
Vol 22 (8) ◽  
pp. 1749-1760
Author(s):  
Yu-Hong GUO ◽  
Yun-Hai TONG ◽  
Shi-Wei TANG ◽  
Leng-Dong WU
Keyword(s):  
Pattern Mining ◽  
Frequent Pattern Mining ◽  
Privacy Preserving ◽  
Frequent Pattern

scholarly journals Genotype Pattern Mining for Pairs of Interacting Variants Underlying Digenic Traits

Genes ◽  
2021 ◽  
Vol 12 (8) ◽  
pp. 1160
Author(s):  
Atsuko Okazaki ◽  
Sukanya Horpaopan ◽  
Qingrun Zhang ◽  
Matthew Randesi ◽  
Jurg Ott
Keyword(s):  
Null Hypothesis ◽  
Pattern Mining ◽  
Genetic Diseases ◽  
Frequent Pattern Mining ◽  
Case Control ◽  
Frequent Pattern ◽  
Permutation Testing ◽  
Case Control Studies ◽  
P Values ◽  
Dna Variants

Some genetic diseases (“digenic traits”) are due to the interaction between two DNA variants, which presumably reflects biochemical interactions. For example, certain forms of Retinitis Pigmentosa, a type of blindness, occur in the presence of two mutant variants, one each in the ROM1 and RDS genes, while the occurrence of only one such variant results in a normal phenotype. Detecting variant pairs underlying digenic traits by standard genetic methods is difficult and is downright impossible when individual variants alone have minimal effects. Frequent pattern mining (FPM) methods are known to detect patterns of items. We make use of FPM approaches to find pairs of genotypes (from different variants) that can discriminate between cases and controls. Our method is based on genotype patterns of length two, and permutation testing allows assigning p-values to genotype patterns, where the null hypothesis refers to equal pattern frequencies in cases and controls. We compare different interaction search approaches and their properties on the basis of published datasets. Our implementation of FPM to case-control studies is freely available.

scholarly journals Frequent Pattern Mining Using Db-Scan Algorithm.

2021 ◽  
Vol 1916 (1) ◽  
pp. 012054
Author(s):  
M Kavitha Margret ◽  
A Ponni ◽  
A Priyanka
Keyword(s):  
Pattern Mining ◽  
Frequent Pattern Mining ◽  
Frequent Pattern

Customized frequent patterns mining algorithms for enhanced Top-Rank-K frequent pattern mining

2021 ◽  
Vol 169 ◽  
pp. 114530
Author(s):  
Areej Ahmad Abdelaal ◽  
Sa'ed Abed ◽  
Mohammad Al-Shayeji ◽  
Mohammad Allaho
Keyword(s):  
Pattern Mining ◽  
Frequent Pattern Mining ◽  
Frequent Pattern ◽  
Frequent Patterns ◽  
Mining Algorithms
Sign in / Sign up

Export Citation Format

Share Document