Abstract
Current literature lacks a thorough study on the discovery of meeting patterns in moving object datasets. We (a) introduced MEMO, a more precise definition of meeting patterns, (b) proposed three new algorithms based on a novel data-driven approach to extract closed MEMOs from moving object datasets and (c) implemented and evaluated them along with the algorithm previously reported in [6], whose performance has never been evaluated. Experiments using real-world datasets revealed that our filter-and-refinement algorithm outperforms the others in many realistic settings.
This project is partially supported by a research grant TDSI/08-001/1A from the Temasek Defense Systems Institute.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Bocca, J.B., Jarke, M., Zaniolo, C. (eds.), Proceedings of 20th International Conference on Very Large Data Bases, VLDB 1994, Santiago de Chile, Chile, September 12-15, pp. 487–499. Morgan Kaufmann, San Francisco (1994)
Benkert, M., Djordjevic, B., Gudmundsson, J., Wolle, T.: Finding popular places. In: Proc. 18th International Symposium on Algorithms and Computation (2007)
Drager, L.D., Lee, J.M., Martin, C.F.: On the geometry of the smallest circle enclosing a finite set of points. Journal of the Franklin Institute 344(7), 929–940 (2007)
Elzinga, J., Hearn, D.W.: Geometrical Solutions for Some Minimax Location Problems. Transportation Science 6(4), 379–394 (1972)
Gudmundsson, J., Kreveld, M., Speckmann, B.: Efficient detection of motion patterns in spatio-temporal data sets. In: Proceedings of the 13th International Symposium of ACM Geographic Information Systems, pp. 250–257 (2004)
Gudmundsson, J., van Kreveld, M.: Computing longest duration flocks in trajectory data. In: GIS 2006: Proceedings of the 14th Annual ACM International Symposium on Advances in Geographic Information Systems, pp. 35–42. ACM, New York (2006)
Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, SIGMOD 2000, pp. 1–12. ACM, New York (2000)
Hwang, S.-Y., Liu, Y.-H., Chiu, J.-K., Lim, E.: Mining mobile group patterns: A trajectory-based approach. In: Ho, T.-B., Cheung, D.W.-L., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol. 3518, pp. 713–718. Springer, Heidelberg (2005)
Jetcheva, J.G., Chen Hu, Y., Palchaudhuri, S., Kumar, A., David, S., Johnson, B.: Design and evaluation of a metropolitan area multitier wireless ad hoc network architecture, pp. 32–43 (2003)
Laube, P., Imfeld, S.: Analyzing relative motion within groups of trackable moving point objects. In: Egenhofer, M.J., Mark, D.M. (eds.) GIScience 2002. LNCS, vol. 2478, p. 132. Springer, Heidelberg (2002)
Patrick Laube, S.I., van Kreveld, M.: Finding remo - detecting relative motion patterns in geospatial lifelines. In: Proceedings of the 11th International Symposium on Spatial Data Handling, pp. 201–215 (March 2004)
Piorkowski, M., Sarafijanovoc-Djukic, N., Grossglauser, M.: A Parsimonious Model of Mobile Partitioned Networks with Clustering. In: The First International Conference on COMmunication Systems and NETworkS (COMSNETS) (January 2009)
Rademacher, H., Toeplitz, O.: The spanning circle of a finite set of points. The Enjoyment of Mathematics: Selection from Mathematics for the Amateur, 103–110 (1957)
Wang, Y., Lim, E.-P., Hwang, S.-Y.: Efficient algorithms for mining maximal valid groups. The VLDB Journal 17(3), 515–535 (2008)
Zaki, M.J.: Scalable algorithms for association mining. IEEE Transactions on Knowledge and Data Engineering 12, 372–390 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aung, H.H., Tan, KL. (2011). Finding Closed MEMOs. In: Bayard Cushing, J., French, J., Bowers, S. (eds) Scientific and Statistical Database Management. SSDBM 2011. Lecture Notes in Computer Science, vol 6809. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22351-8_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-22351-8_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22350-1
Online ISBN: 978-3-642-22351-8
eBook Packages: Computer ScienceComputer Science (R0)