.png){kind=icon}
返回
Discovering Conservation Rules
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2012.171.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Many applications process data in which there exists a conservation law between related quantities. For example, in traffic monitoring, every incoming event, such as a packet's entering a router or a car's entering an intersection, should ideally have an immediate outgoing counterpart. We propose a new class of constraints-Conservation Rules-that express the semantics and characterize the data quality of such applications. We give confidence metrics that quantify how strongly a conservation rule holds and present approximation algorithms (with error guarantees) for the problem of discovering a concise summary of subsets of the data that satisfy a given conservation rule. Using real data, we demonstrate the utility of conservation rules and we show order-of-magnitude performance improvements of our discovery algorithms over naive approaches.
Keyword:
Data mining
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.9K
被引数:
3.2W
机构
引用论文
UNE PROPRIÉTÉ DYNAMIQUE DES HOMÉOMORPHISMES DU PLAN AU VOISINAGE D’UN POINT FIXE D’INDICE >1.png)
Topology
OAAI
TopologyIF0
OAAI分享收藏
查看更多内容