返回
Mining mutually dependent patterns for system management
DOI:10.1109/JSAC.2002.1003039.png)
摘要
En 中文
In some domains, such as isolating problems in computer networks and discovering stock market irregularities, there is more interest in patterns consisting of infrequent, but highly correlated items rather than patterns that occur frequently (as defined by minsup, the minimum support level). Herein, we describe m-pattern, a new pattern that is defined in terms of minp. the minimum probability of mutual dependence of items in the pattern. We show that all infrequent m-pattern can be discovered by an efficient algorithm that makes use of: 1) a linear algorithm to qualify an m-pattern, 2) an effective technique for candidate pruning based on a necessary condition for the presence of an m-pattern: and 3) a level-wise search for m-pattern discovery (which is possible because m-patterns are downward closed). Further. we consider frequent m-patterns, which are defined in terms of both minp and minsup. Using synthetic data, we study the scalability of our algorithm. Then, we apply our algorithm to data from a production computer network both to show the m-patterns present and to contrast with frequent pattern,,,. We show that when minp = 0. our algorithm is equivalent to finding frequent patterns. However, with a larger minp, our algorithm yields a modest number of highly correlated items, which makes it possible to mine for infrequent but highly correlated itemsets. To date, many actionable m-patterns have been discovered in production systems.
Keyword:
data mining
dependent pattern
event mining
pattern discovery
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
17.2
论文数:
6.4K
被引数:
3.1W
机构
暂无机构信息
引用论文
The over-expression of survivin enhances the chemotherapeutic efficacy of YM155 in human hepatocellular carcinoma
Oncotarget
IF0
Integrated microRNA and mRNA Transcriptome Sequencing Reveals the Potential Roles of miRNAs in Stage I Endometrioid Endometrial Carcinoma
PLoS ONE
IF0

