Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules Between Sets of Items in Large Databases. In: Proceedings. of the ACM International. Conference. on Management of Data, Washington, USA, May 1993
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings. of the 20th International. Conf. on Very Large Databases, pp. 487–499, Santiago, Chile, Aug 1994.
Auguston J.G., Minker J. (1970) An analysis of some graph theoretical cluster Techniques. J. ACM 17, 571–588
Bayardo, R.J.Jr.: Efficiently Mining Long Patterns from Databases. In: Proceedings. of 1998 ACM-SIGMOD International Conference. on Management of Data, San Jose, California, 1998
Bron C., Kerbosch J. (1973) Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16, 575–577
Burdick, D., Calimlim, M., Gehrke, J.: MAFIA: a maximal frequent itemset algorithm for transactional databases. In: Proceedings. of the 17th International Conference on Data Engineering, Heidelberg, Germany, April 2001.
Davis R.W., Hagey W., Horning M. (2004) Monitoring the behavior and multi-Dimensional movements of Weddell Seals using an animal-borne video and data recorder. Mem. Nat. Inst. Polar Rese. 58, 150–156
Empower Geographics. Market segmentation and demo- graphic analysis. http://www.empower.com/market-segmen- tation.htm
Forsyth, D.R.: Group Dynamics. Wadsworth, Belmont, CA, 3 edition, 1999.
Garton, L., Haythornthwaite, C., Wellman, B.: Studying online social networks. J. Comput. Mediat. Commun.3(1), (1997)
Giaglis, G., Kourouthanasis, P., Tsamakos, A.: Towards a Classification Network for Mobile Location Services. In: Mennecke, B.E., Strader, T.J.(eds.)Mobile Commerce:Technology, Theory and Applications. Idea Group Publishing (2002)
Han, J., Pei, J., Yin, Y.: Mining Frequent Pettern Without Candidate Generation. In: Proceedings. of International. Conference. on Management of Data (SIGMOD’00), Dallas, TX, May 2000
Harary F., Ross I.C. (1957) A procedure for clique detection using the group matrix. Sociometry 20, 205–215
Johnston H.C. (1976) Cliques of a graph: variations on the Bron–Kerbosch algorithm. Int. J. Comput. Inform. Sci. 5: 209–238
Karam, Zaki, M.J.: Efficiently mining maximal frequent Itemsets. In: Proceedings. of 2001 IEEE International Conference on Data Mining (ICDM’01), San Jose, California, November 2001
Kaufman, J.H., Myllymaki, J., Jackson, J.: IBM Almaden Research Center. http://www.alphaworks.ibm.com/tech/citysimulator, December 2001
Loukakis E., Tsouros C. (1981) A Depth First Search Algorithm to Generate the Family of Maximal Independent Sets of a Graph Lexicographically. Computing, 27: 249–266
Mulligan G.D., Corneil D.G. (1972) Corrections to Bierstone’s Algorithm for Generating Cliques. J. ACM 19, 244–247
Rymon, R.: Search through systematic set enumeration. In: Proceedings. of the Third International Conference on Principles of Knowledge Representation and Reasoning (1992)
Schafer J.B., Konstan J.A., Riedl J. (2001) E-commerce recommendation applications. Data Min. Knowl. Discov. 5(1/2): 115–153
Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for finding all the cliques. Technical Report UEC-TR-C5, 1988
Tsukiyama S., Ide M., Aviyoshi H., Shirakawa I. (1977) A new algorithm for generating all the maximum independent sets. SIAM J. Comput. 6, 505–517
Wang, Y., Lim, E.-P., Hwang, S.-Y.: On Mining Group Patterns of Mobile Users. In: Proceedings. of the 14th International Conference on Database and Expert Systems Applications. DEXA 2003, Prague, Czech Republic, 1–5 Sep 2003.
Wang, Y., Lim, E.-P., Hwang, S.-Y.: Efficient group pattern mining using data summarization. In: Proceedings. of the 9th International Conference on Database Systems for Advanced Applications - DASFAA 2004, Jeju Island, KOREA, March 17–19 2004
Xu J.J., Chen H. (2005) CrimeNet explorer: a framework for criminal network knowledge discovery. ACM Trans. Inf. Syst, 23(2): 201–226
Zarchan P. Global Positioning System: Theory and Applications, vol I. American Institute of Aeronautics and Astronautics (1996)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wang, Y., Lim, EP. & Hwang, SY. Efficient algorithms for mining maximal valid groups. The VLDB Journal 17, 515–535 (2008). https://doi.org/10.1007/s00778-006-0019-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00778-006-0019-9