Mining conditional patterns in a database

Authors:
Animesh Adhikari;P. R. Rao
Affiliations:
Department of Computer Science, SP Chowgule College, Margao, Goa 403 602, India;Department of Computer Science and Technology, Goa University, Goa 403 206, India
Venue:
Pattern Recognition Letters
Year:
2008

Citing 8
Cited 3

Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Mining frequent patterns without candidate generation

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Advances in predictive models for data mining

Pattern Recognition Letters - Special issue on machine learning and data mining in pattern recognition
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
An Efficient Algorithm for Mining Association Rules in Large Databases

VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Selecting the right interestingness measure for association patterns

Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Mining positive and negative association rules: an approach for confined rules

PKDD '04 Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases
Partition based pattern synthesis technique with efficient algorithms for nearest neighbor classification

Pattern Recognition Letters

Measuring influence of an item in a database over time

Pattern Recognition Letters
Clustering local frequency items in multiple databases

Information Sciences: an International Journal
A Framework for Synthesizing Arbitrary Boolean Queries Induced by Frequent Itemsets

International Journal of Knowledge-Based Organizations

Quantified Score

Hi-index	0.10

Visualization

Abstract

Though frequent itemsets and association rules express interesting association among items of frequently occurring itemsets in a database, there may exist other types of interesting associations among the items. A critical analysis of frequent itemsets would provide more insight about a database. In this paper, we introduce the notion of conditional pattern in a database. Conditional patterns are interesting and useful for solving many problems. We propose an algorithm for mining conditional patterns in a database. Experiments are conducted on three real datasets. The results of the experiments show that conditional patterns store significant nuggets of knowledge about a database.