78,913 Hits in 8.9 sec

Efficient Closed Pattern Mining in Strongly Accessible Set Systems (Extended Abstract) [chapter]

Mario Boley, Tamás Horváth, Axel Poigné, Stefan Wrobel
Lecture Notes in Computer Science  
., in track mining, we consider a generalization of this problem to strongly accessible set systems and arbitrary closure operators.  ...  For this more general problem setting, the closed sets can be enumerated with polynomial delay if deciding membership in the set system and computing the closure operator can be solved in polynomial time  ...  Conclusion In this paper, we have presented a positive result on efficient enumeration of the family of closed sets of strongly accessible set systems with respect to arbitrary closure operators.  ... 
doi:10.1007/978-3-540-74976-9_37 fatcat:zg72jrpkznbe5ppwci6c2ybeka

Para Miner: a generic pattern mining algorithm for multi-core architectures

Benjamin Negrevergne, Alexandre Termier, Marie-Christine Rousset, Jean-François Méhaut
2013 Data mining and knowledge discovery  
ParaMiner is built on the principles of pattern enumeration in strongly accessible set systems.  ...  In this paper, we present ParaMiner which is a generic and parallel algorithm for closed pattern mining.  ...  Algorithm 2 Enumerate closed patterns in strongly accessible set systems Require: An strongly accessible set system (E, F ), a closure operator Clo and a dataset D E .  ... 
doi:10.1007/s10618-013-0313-2 fatcat:75xk2chzwvcvdbeea2jfv6pup4

Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems [chapter]

Hiroki Arimura, Takeaki Uno
2009 Proceedings of the 2009 SIAM International Conference on Data Mining  
For a class of accessible set systems with a tree-like structure, we present an efficient depth-first search algorithm that finds all closed sets in accessible set systems without duplicates in polynomial-delay  ...  In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, proposed by Boley, Horváth  ...  general approach to closed pattern mining [12] .  ... 
doi:10.1137/1.9781611972795.93 dblp:conf/sdm/ArimuraU09 fatcat:vgpq3firajdwlodrb6s25gbocm

Efficiently Depth-First Minimal Pattern Mining [chapter]

Arnaud Soulet, François Rioult
2014 Lecture Notes in Computer Science  
In this paper, we present a generic framework for minimal patterns mining by introducing the concept of minimizable set system.  ...  Then, for any minimizable set system, we introduce a fast minimality check that is easy to incorporate in a depth-first search algorithm for mining the minimal patterns.  ...  A minimizable set system is a tuple (F, E), G, cov, φ where: -(F, E) is a finite, strongly accessible set system. A feasible set in F is called a pattern.  ... 
doi:10.1007/978-3-319-06608-0_3 fatcat:fgqlcw5elbgwhn22n7cgtwlvlm

Mining Interesting Patterns in Multi-relational Data with N-ary Relationships [chapter]

Eirini Spyropoulou, Tijl De Bie, Mario Boley
2013 Lecture Notes in Computer Science  
In this paper we introduce a novel approach to mining patterns in multi-relational data. We propose a new syntax for multi-relational patterns as complete connected subsets of database entities.  ...  We propose RMiner, a simple yet practically efficient divide and conquer algorithm to mine such patterns which is an instantiation of an algorithmic framework for efficiently enumerating all fixed points  ...  Acknowledgements We are grateful to Michael Mampaey for providing the Smurfig code and data and for his support in using Smurfig, Siegfried Nijssen for his assistance in using Farmer and Thomas Gärtner  ... 
doi:10.1007/978-3-642-40897-7_15 fatcat:2sdvgwjbnfgypmyp5tfnkygcwy

A Closed Frequent Subgraph Mining Algorithm in Unique Edge Label Graphs [chapter]

Nour El Islem Karabadji, Sabeur Aridhi, Hassina Seridi
2016 Lecture Notes in Computer Science  
Problems such as closed frequent subset mining, itemset mining, and connected tree mining can be solved in a polynomial delay.  ...  In this work, graph and subgraph isomorphism problems are reduced to set inclusion and set equivalence relations.  ...  A unique edge label subgraph system P i is strongly accessible. Proof.  ... 
doi:10.1007/978-3-319-41920-6_4 fatcat:l4zeijdsinfs7n2krzpndyvgha

Study on Visual Techniques of Potential Pattern Discovery for Time Series Data

Dalin Xu, Yingmei Wei, Yansong Wang
2018 MATEC Web of Conferences  
Sequential pattern mining is always a very important branch of time series data mining. The pattern mining with visual means can be used to extract the knowledge of time series data more intuitively.  ...  Based on the research content, this paper analyzes the sequence pattern mining methods in different aspects and their combination with visualization technology.  ...  Closed pattern mining Closed pattern mining is an improvement for the traditional pattern mining.  ... 
doi:10.1051/matecconf/201823202049 fatcat:nuop2gl27bbh5d5d4ioedwrepm

A Recent Review on Itemset Tree Mining: MEIT Technique

Tanvi P.Patel, Warish D. Patel
2015 International Journal of Computer Applications  
It aims to extract interesting correlations, frequent patterns, associations or casual structures among sets of items in the transaction databases or other data repositories.  ...  Hence, Association rule mining is imperative to mine patterns and then generate rules from these obtained patterns.  ...  Frequent pattern mining searches for recurring relationships in a given data set.  ... 
doi:10.5120/19922-2121 fatcat:4dvzjqhewffinb5szgvhoggake

CTDGM: A Data Grouping Model Based on Cache Transaction for Unstructured Data Storage Systems [article]

Dongjie Zhu, Haiwen Du, Yundong Sun, Zhaoshuo Tian
2020 arXiv   pre-print
degradation in the performance of data access.  ...  Cache prefetching technology has become the mainstream data access optimization strategy in the data centers.  ...  Moreover, in real storage systems, the number of data access logs is extremely large, and data access patterns change rapidly.  ... 
arXiv:2009.14414v1 fatcat:sd3xp36qprb6ra53jzkidfmv5y

A Method for Closed Frequent Subgraph Mining in a Single Large Graph

Lam B.Q. Nguyen, Loan T.T. Nguyen, Ivan Zelinka, Vaclav Snasel, Hung Son Nguyen, Bay Vo
2021 IEEE Access  
pattern mining in attributed graphs.  ...  Let S = (VS, ES, LS) be a subgraph of efficient algorithm for mining closed graph patterns in a a graph G = (V, E, L), u ∈ V and v ∈ VS.  ... 
doi:10.1109/access.2021.3133666 fatcat:pylxdtrl3zecnovh3arl3e5f4i

A Survey of Dynamic Replication Strategies based on Data Mining Techniques

Ms. Prema. R
2019 International Journal for Research in Applied Science and Engineering Technology  
To improve the dynamic data management in grid computing the efficient replication strategy needs to be followed.  ...  In this paper, we focused on various data mining based replication strategies to enhance data replication which are important data management techniques commonly used in data grids.  ...  REPLICATION Data replication is an efficient data management technique which is used for decades in many systems [1] .  ... 
doi:10.22214/ijraset.2019.2175 fatcat:dgetiadgzvgr3b7cl3qdhnrkwu

APEX: A personalization framework to improve quality of experience for DVD-like functions in P2P VoD applications

Tianyin Xu, Baoliu Ye, Qinhui Wang, Wenzhong Li, Sanglu Lu, Xiaoming Fu
2010 2010 IEEE 18th International Workshop on Quality of Service (IWQoS)  
APEX makes the personalization practical by using a hybrid architecture which leverages the offline pattern mining on the server side and online collaborative filtering on the peer side.  ...  Most existing solutions are based on the unreasonable assumption that all the users in P2P VoD systems have the same preference.  ...  Mining User Access Patterns The tracker mines the topic-oriented user access patterns in three steps: (1) Generate the state set S by extracting strongly associated segments into one state; (2) Compute  ... 
doi:10.1109/iwqos.2010.5542758 dblp:conf/iwqos/XuYWLLF10 fatcat:c2s3sfhip5b7tdzqp7uxs5rtra

A Caching Strategy for Transparent Computing Server Side Based on Data Block Relevance

2018 Information  
In this method, we adjust a model that is based on a frequent pattern tree (FP-tree) for mining frequent patterns from data streams (FP-stream) to the characteristics of data access in TC, and we devise  ...  Finally, the access process in TC with real access traces in different caching strategies.  ...  In the CPCS, we improve the efficiency of the FP-stream's mining frequent patterns and apply it to the data stream accessed in TC.  ... 
doi:10.3390/info9020042 fatcat:lgnfhwseuvf2pdbqvemelxu7mm

Mining Patterns and Violations Using Concept Analysis [chapter]

Christian Lindig
2015 The Art and Science of Analyzing Software Data  
Large programs develop patterns in their implementation and behavior that can be used for defect mining.  ...  Blocks form a hierarchy in which each block corresponds to a pattern and neighboring blocks to a violation. Furthermore, blocks may be computed efficiently and searched for violations.  ...  PR-Miner is based on frequent itemset mining and mines closed feature sets. A violation (called a rule) is represented as an implication A ⇒ B where A and B are closed feature sets.  ... 
doi:10.1016/b978-0-12-411519-4.00002-1 fatcat:7ssfzerikrejfejlsamzexoup4

Frequent pattern mining: current status and future directions

Jiawei Han, Hong Cheng, Dong Xin, Xifeng Yan
2007 Data mining and knowledge discovery  
Frequent pattern mining has been a focused theme in data mining research for over a decade.  ...  Abundant literature has been dedicated to this research and tremendous progress has been made, ranging from efficient and scalable algorithms for frequent itemset mining in transaction databases to numerous  ...  proposed TD-Close to find the complete set of frequent closed patterns in high dimensional data.  ... 
doi:10.1007/s10618-006-0059-1 fatcat:fpblaafhurfbtiimurret4idde
« Previous Showing results 1 — 15 out of 78,913 results