Mining unexpected multidimensional rules
Proceedings of the ACM tenth international workshop on Data warehousing and OLAP
Role Assertion Analysis: a proposed method for ontology refinement through assertion learning
Proceedings of the 2008 conference on STAIRS 2008: Proceedings of the Fourth Starting AI Researchers' Symposium
Analysis of social communities with iceberg and stability-based concept lattices
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
First elements on knowledge discovery guided by domain knowledge (KDDK)
CLA'06 Proceedings of the 4th international conference on Concept lattices and their applications
Finding minimal rare itemsets and rare association rules
KSEM'10 Proceedings of the 4th international conference on Knowledge science, engineering and management
Constraint programming for mining n-ary patterns
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Mining fuzzy specific rare itemsets for education data
Knowledge-Based Systems
RM-Tool: A framework for discovering and evaluating association rules
Advances in Engineering Software
RP-Tree: rare pattern tree mining
DaWaK'11 Proceedings of the 13th international conference on Data warehousing and knowledge discovery
Finding top-N chance patterns with KeyGraph®-based importance
KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part II
ReDRIVE: result-driven database exploration through recommendations
Proceedings of the 20th ACM international conference on Information and knowledge management
An algorithm for extracting rare concepts with concise intents
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
NORT: runtime anomaly-based monitoring of malicious behavior for windows
RV'11 Proceedings of the Second international conference on Runtime verification
Finding top-n colossal patterns based on clique search with dynamic update of graph
ICFCA'12 Proceedings of the 10th international conference on Formal Concept Analysis
Rare pattern mining on data streams
DaWaK'12 Proceedings of the 14th international conference on Data Warehousing and Knowledge Discovery
ISMIS'12 Proceedings of the 20th international conference on Foundations of Intelligent Systems
Non-redundant rare itemset generation
AusDM '09 Proceedings of the Eighth Australasian Data Mining Conference - Volume 101
Understanding the Regularity and Variability of Human Mobility from Geo-trajectory
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 01
Causal inference with rare events in large-scale time-series data
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Mining frequent itemsets in data streams within a time horizon
Data & Knowledge Engineering
YmalDB: exploring relational databases via result-driven recommendations
The VLDB Journal — The International Journal on Very Large Data Bases
A time-efficient breadth-first level-wise lattice-traversal algorithm to discover rare itemsets
Data Mining and Knowledge Discovery
| Hi-index | 0.00 |
We describe here a general approach for rare itemset mining. While mining literature has been almost exclu- sively focused on frequent itemsets, in many practical sit- uations rare ones are of higher interest (e.g., in medical databases, rare combinations of symptoms might provide useful insights for the physicians). Based on an examina- tion of the relevant substructures of the mining space, our approach splits the rare itemset mining task into two steps, i.e., frequent itemset part traversal and rare itemset listing. We propose two algorithms for step one, a na篓ive and an optimized one, respectively, and another algorithm for step two. We also provide some empirical evidence about the performance gains due to the optimized traversal.