2000
DOI: 10.1023/a:1009887712954
|View full text |Cite
|
Sign up to set email alerts
|

Untitled

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2001
2001
2019
2019

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 70 publications
(2 citation statements)
references
References 12 publications
0
2
0
Order By: Relevance
“…One example, is the research presented in Boulicaut, Klemettinen, and Mannila (1999), where the principle is demonstrated for association rules. Sarawagi, Thomas, and Agrawal (2000) use the same principle related to association rules and compare performances of several alternatives, by means of distinct SQL versions (SQL92 and SQL-OR). Using only basic SQL3 constructions and functions, Jamil (2004) shows that any object relational database can be mined for association rules.…”
Section: Using Standard Sqlmentioning
confidence: 99%
“…One example, is the research presented in Boulicaut, Klemettinen, and Mannila (1999), where the principle is demonstrated for association rules. Sarawagi, Thomas, and Agrawal (2000) use the same principle related to association rules and compare performances of several alternatives, by means of distinct SQL versions (SQL92 and SQL-OR). Using only basic SQL3 constructions and functions, Jamil (2004) shows that any object relational database can be mined for association rules.…”
Section: Using Standard Sqlmentioning
confidence: 99%
“…The development of data mining algorithms also supports the analysis and utilization of massive data. The use of the association rule is effective for massive data processing in finding items among attributes of a large database hidden in relationships (Sarawagi et al 2000). Violations are usually related to the construction phase.…”
Section: Introductionmentioning
confidence: 99%