Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Efficiently mining long patterns from databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
An Analysis of Some Graph Theoretical Cluster Techniques
Journal of the ACM (JACM)
Corrections to Bierstone's Algorithm for Generating Cliques
Journal of the ACM (JACM)
Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Algorithm 457: finding all cliques of an undirected graph
Communications of the ACM
E-Commerce Recommendation Applications
Data Mining and Knowledge Discovery
MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases
Proceedings of the 17th International Conference on Data Engineering
Efficiently Mining Maximal Frequent Itemsets
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Towards a classification framework for mobile location services
Mobile commerce
CrimeNet explorer: a framework for criminal network knowledge discovery
ACM Transactions on Information Systems (TOIS)
SSDBM'10 Proceedings of the 22nd international conference on Scientific and statistical database management
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
User-Centric Similarity and Proximity Measures for Spatial Personalization
International Journal of Data Warehousing and Mining
Anytime algorithms for mining groups with maximum coverage
AusDM '12 Proceedings of the Tenth Australasian Data Mining Conference - Volume 134
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Hi-index | 0.00 |
A valid group is defined as a group of moving users that are within a distance threshold from one another for at least a minimum time duration. Unlike grouping of users determined by traditional clustering algorithms, members of a valid group are expected to stay close to one another during their movement. Each valid group suggests some social grouping that can be used in targeted marketing and social network analysis. The existing valid group mining algorithms are designed to mine a complete set of valid groups from time series of user location data, known as the user movement database. Unfortunately, there are considerable redundancy in the complete set of valid groups. In this paper, we therefore address this problem of mining the set of maximal valid groups. We first extend our previous valid group mining algorithms to mine maximal valid groups, leading to AMG and VGMax algorithms. We further propose the VGBK algorithm based on maximal clique enumeration to mine the maximal valid groups. The performance results of these algorithms under different sets of mining parameters are also reported.