Frequent Subgraph Mining Based Collaboration Pattern Analysis for Wikipedia
نویسندگان
چکیده
منابع مشابه
An Efficiently Computable Support Measure for Frequent Subgraph Pattern Mining
Frequent subgraph pattern mining is an important graph mining task. While the majority of existing systems focus on the transactional setting, where every transaction is a separate, independent graph, in recent years there has been an increasing interest in mining large networks. In particular, given a network (also called database graph) D, a pattern language L, a frequency measure freq and a ...
متن کاملVisCFSM: Visual, Constraint-Based, Frequent Subgraph Mining
Graphs long have been valued as a pictorial way of representing relationships between entities. Contemporary applications use graphs to model social networks, protein interactions, chemical structures, and a variety of other systems. In many cases, it is useful to detect patterns within graphs. For example, one could be interested in identifying frequently occurring subgraphs, which is known as...
متن کاملFrequent Subgraph Mining Based on Pregel
Graph is an increasingly popular way to model complex data, and the size of single graphs is growing toward massive. Nonetheless, executing graph algorithms efficiently and at scale is surprisingly challenging. As a consequence, distributed programming frameworks have emerged to empower large graph processing. Pregel, as a popular computational model for processing billion-vertex graphs, has be...
متن کاملThe ParMol Package for Frequent Subgraph Mining
Mining for frequent subgraphs in a graph database has become a popular topic in the last years. Algorithms to solve this problem are used in chemoinformatics to find common molecular fragments in a database of molecules represented as two-dimensional graphs. However, the search process in arbitrary graph structures includes costly graph and subgraph isomorphism tests. In our ParMol package we h...
متن کاملThe Gaston Tool for Frequent Subgraph Mining
Given a database of graphs, structure mining algorithms search for all substructures that satisfy constraints such as minimum frequency, minimum confidence, minimum interest and maximum frequency. In order to make frequent subgraph mining more efficient, we propose to search with steps of increasing complexity. We present the GrAph/Sequence/Tree extractiON (Gaston) tool that implements this ide...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Technology And Control
سال: 2019
ISSN: 2335-884X,1392-124X
DOI: 10.5755/j01.itc.48.2.20028