2011
DOI: 10.4018/jdwm.2011070103
|View full text |Cite
|
Sign up to set email alerts
|

Weak Ratio Rules

Abstract: This paper examines the problem of weak ratio rules between nonnegative real-valued data in a transactional database. The weak ratio rule is a weaker form than Flip Korn's ratio rule. After analyzing the mathematical model of weak ratio rules problem, the authors conclude that it is a generalization of Boolean association rules problem and every weak ratio rule is supported by a Boolean association rule. Following the properties of weak ratio rules, the authors propose an algorithm for mining an important subs… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
1
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 25 publications
0
1
0
Order By: Relevance
“…(1) The dam monitoring parameter data are symbolized and divided into subseries. As the data is all numerical, it needs to be converted to the Boolean type supported by the Apriori algorithm [25]. The input length of the original data is truncated into a number of subseries using a sliding window.…”
Section: Apriori-based Temporal Correlation Analysis Between Dam Moni...mentioning
confidence: 99%
“…(1) The dam monitoring parameter data are symbolized and divided into subseries. As the data is all numerical, it needs to be converted to the Boolean type supported by the Apriori algorithm [25]. The input length of the original data is truncated into a number of subseries using a sliding window.…”
Section: Apriori-based Temporal Correlation Analysis Between Dam Moni...mentioning
confidence: 99%
“…Based on the type of values handled by the rule, the association rule can be classified as Boolean association rule and quantitative association rule. The presence or absence of items is the only concern of Boolean association rule (Agrawal, Imielinski, & Swami, 1993;Jiang, Hu, Wei, Song, Han, & Liang, 2011;Prakash, Kumar, & Gupta, 2011). Market basket analysis is an example of Boolean association rule mining.…”
Section: Association Rule Miningmentioning
confidence: 99%
“…In association rule based cache replacement method, the client access history is mined to get association rules and a confidence value (Jiang et al, 2011;Ashrafi et al, 2004, Tjioe & Taniar, 2005Kwok et al, 2002;. Other caching variables (such as modification rate, cache invalidation delay, data messages size and retrieval delay) of the resulting rules are used in computing the objective function (Ashrafi et al, 2007;Trasarti et al, 2011;Khan et al, 2011;Koh & Pears, 2011) to determine which data item it to be replaced.…”
Section: Related Workmentioning
confidence: 99%