SemGrAM: integrating semantic graphs into association rule mining

Authors:
John F. Roddick;Peter Fule
Affiliations:
Flinders University of South Australia, Adelaide, South Australia;Flinders University of South Australia, Adelaide, South Australia and Defence Science and Technology Organisation, Edinburgh, Australia
Venue:
AusDM '07 Proceedings of the sixth Australasian conference on Data mining and analytics - Volume 70
Year:
2007

Citing 24
Cited 2

Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
The Normalized String Editing Problem Revisited

IEEE Transactions on Pattern Analysis and Machine Intelligence
Mining fuzzy association rules in databases

ACM SIGMOD Record
Mining generalized association rules

Future Generation Computer Systems - Special double issue on data mining
Mining frequent patterns without candidate generation

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Mining generalised disjunctive association rules

Proceedings of the tenth international conference on Information and knowledge management
Mining Multiple-Level Association Rules in Large Databases

IEEE Transactions on Knowledge and Data Engineering
A Survey of Temporal Knowledge Discovery Paradigms and Methods

IEEE Transactions on Knowledge and Data Engineering
Mining Sequential Patterns: Generalizations and Performance Improvements

EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
Clustering Association Rules

ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Mining Sequential Patterns

ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique

ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
CCAIIA: Clustering Categorial Attributed into Interseting Accociation Rules

PAKDD '98 Proceedings of the Second Pacific-Asia Conference on Research and Development in Knowledge Discovery and Data Mining
Discovery of Spatial Association Rules in Geographic Information Databases

SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
Mining Flexible Multiple-Level Association Rules in All Concept Hierarchies (Extended Abstract)

DEXA '98 Proceedings of the 9th International Conference on Database and Expert Systems Applications
A unifying semantic distance model for determining the similarity of attribute values

ACSC '03 Proceedings of the 26th Australasian computer science conference - Volume 16
ROCK: A Robust Clustering Algorithm for Categorical Attributes

ICDE '99 Proceedings of the 15th International Conference on Data Engineering
An Approach to Intensional Query Answering at Multiple Abstraction Levels Using Data Mining Approaches

HICSS '99 Proceedings of the Thirty-second Annual Hawaii International Conference on System Sciences-Volume 6 - Volume 6
Visualising hierarchical associations

Knowledge and Information Systems
Association mining

ACM Computing Surveys (CSUR)
Clustering Using a Similarity Measure Based on Shared Near Neighbors

IEEE Transactions on Computers
Mining association rules with multiple minimum supports using maximum constraints

International Journal of Approximate Reasoning
The Strange Logic of Random Graphs

The Strange Logic of Random Graphs
A multi-level framework for the analysis of sequential data

Data Mining

Higher order mining

ACM SIGKDD Explorations Newsletter
A relational approach for discovering frequent patterns with disjunctions

DaWaK'10 Proceedings of the 12th international conference on Data warehousing and knowledge discovery

Quantified Score

Hi-index	0.00

Visualization

Abstract

To date, most association rule mining algorithms have assumed that the domains of items are either discrete or, in a limited number of cases, hierarchical, categorical or linear. This constrains the search for interesting rules to those that satisfy the specified quality metrics as independent values or as higher level concepts of those values. However, in many cases the determination of a single hierarchy is not practicable and, for many datasets, an item's value may be taken from a domain that is more conveniently structured as a graph with weights indicating semantic (or conceptual) distance. Research in the development of algorithms that generate disjunctive association rules has allowed the production of rules such as Radios ∨ TVs → Cables. In many cases there is little semantic relationship between the disjunctive terms and arguably less readable rules such as Radios ∨ Tuesday → Cables can result. This paper describes two association rule mining algorithms, SemGrAMG and SemGrAMP, that accommodate conceptual distance information contained in a semantic graph. The SemGrAM algorithms permit the discovery of rules that include an association between sets of cognate groups of item values. The paper discusses the algorithms, the design decisions made during their development and some experimental results.