返回
Mining concise patterns on graph-connected itemsets
DOI:10.1016/j.neucom.2018.03.084.png)
摘要
En 中文
The itemset is a basic and usual form of data. People can obtain new insights into their business by discovering its implicit regularities through pattern mining. In some real applications, e.g., network alarm association, the itemsets usually have the following two characteristics: (1) the observed samples come from different entities, with inherent structural relationships implied in their static properties; (2) the samples are scarce, which may lead to incomplete pattern extraction. This paper considers how to efficiently find a concise set of patterns on such kind of data. Firstly, we use a graph to express the entities and their interconnections and propagate every sample to every node with a weight, determined by the pre-defined combination of kernel functions based on the similarities of the nodes and patterns. Next, the weight values can be naturally imported into the MDL-based filtering process and bring a differentiated pattern set for each node. Experiments show that the solution can outperform the global solution (trading all nodes as one) and isolated solution (removing all edges) on simulated and real data, and its effectiveness and scalability can be further verified in the application of large-scale network operation and maintenance. (C) 2018 Elsevier B.V. All rights reserved.
Keyword:
Pattern mining
MDL
Graph
Diffusion kernel
Maximal entropy random walk
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
On extending extreme learning machine to non-redundant synergy pattern based graph classification
NEUROCOMPUTING
IF6.5
Feature selection based on closed frequent itemset mining: A case study on SAGE data classification
NEUROCOMPUTING
IF6.5
Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later
SIAM REVIEW
IF6.1

