Clustering objects in a road network

Ruan Jian Xue Bao/Journal of Software

Volumn 18, Issue 2, 2007, Pages 332-344

  Chen, Ji Dong ^a   Meng, Xiao Feng ^a   Lai, Cai Feng ^a  

^a RENMIN UNIVERSITY OF CHINA   (China)

Author keywords

Clustering; Data mining; Network distance; Road network; Shortest path; Spatial object

Indexed keywords

DATA MINING;

EUCLIDEAN SPACE; NETWORK DISTANCE; ROAD NETWORK; SHORTEST PATH; SPATIAL OBJECT;

CLUSTERING ALGORITHMS;

EID: 34147204493     PISSN: 10009825     EISSN: None     Source Type: Journal    
DOI: 10.1360/jos180332     Document Type: Article

References (20)

1. Han JW, Kambr M. Data Mining Concepts and Techniques. 2nd ed., Beijing: China Machine Press, 2001. 335-395.
2. Ng RT, Han J. Efficient and effective clustering methods for spatial data mining. In: Bocca JB, Jarke M, Zaniolo C, eds. Proc. of the 20th Int'l Conf. on Very Large Data Bases (VLDB). San Fransisco: Morgan Kaufmann Publishers, 1994. 144-155.
3. Zhang T, Ramakrishnan R, Livny M. BIRCH: An effcient data clustering method for very large databases. In: Jagadish HV, Mumick IS, eds. Proc. of the ACM SIGMOD Int'l Conf. on Management of Data. New York: ACM Press, 1996. 103-114.
4. Guha S, Rastogi R, Shim K. CURE: An efficient clustering algorithm for large databases. In: Haas LM, Tiwary A, eds. Proc. of the ACM SIGMOD Int'l Conf. on Management of Data. New York: ACM Press, 1998. 73-84.
5. Nanopoulos A, Theodoridis Y, Manolopoulos Y. C2P: Clustering based on closest pairs. In: Apers PMG, Atzeni P, Ceri S, eds. Proc. of the 27th Int'l Conf. on Very Large Data Bases (VLDB). San Fransisco: Morgan Kaufmann Publishers, 2001. 331-340.
6. Karypis G, Han EH, Kumar V. Chameleon: Hierarchical clustering using dynamic modeling. IEEE Computer, 1999, 32 (8): 68-75.
7. Martin E, Kriegel HP, Sander J, Xu X. A density-based algorithm for discovering clusters in large spatial databases with noise. In: Simoudis E, Han JW, Fayyad UM, eds. Proc. of the 2nd Int'l Conf. on Knowledge Discovery and Data Mining (KDD). Portland: AAAI Press, 1996. 226-231.
8. Ankerst M, Breunig M, Kriegel HP, Sander J. OPTICS: Ordering points to identify the clustering structure. In: Delis A, Faloutsos C, Ghandeharizadeh S, eds. Proc. of the ACM SIGMOD Int'l Conf. on Management of Data. New York: ACM Press, 1999. 49-60.
9. Agrawal R, Gehrke J, Gunopulos D, Raghavan P. Automatic subspace clustering of high dimensional data for data mining applications. In: Haas LM, Tiwary A, eds. Proc. of the ACM SIGMOD Int'l Conf. on Management of Data. New York: ACM Press, 1998. 94-105.
10. Ma S, Wang TJ, Tang SW, Yang DQ, Gao J. Dynamic reorganization of location databases based on clustering. Journal of Software, 2003, 14 (5): 963-969 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/14/963.htm
11. Zhang M, Gan J. Fuzzy partitional clustering algorithms. Journal of Software, 2004, 15 (6): 858-868 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/15/858.htm
12. Qiang WN, Zhou AY. Analyzing popular clustering algorithms from different viewpoints. Journal of Software, 2002, 13 (8): 1382-1394 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/13/1382.pdf
13. Yiu ML, Mamoulis N. Clustering objects on a spatial network. In: Weikum G, König AC, Deβloch S, eds. Proc. of the ACM SIGMOD Int'l Conf. on Management of Data. New York: ACM Press, 2004. 443-454.
14. Shekhar S, Liu D. CCAM: A connectivity clustered access method for networks and network computations. IEEE Trans. on Knowledge and Data Engineering, 1997, 19 (1): 102-119.
15. Terrovitis M, Bakiras S, Papadias D, Mouratidis K. Constrained shortest path computation. In: Medeiros CB, Egenhofer MJ, Bertino E, eds. Proc. of the 9th Int'l Symp. on Spatial and Temporal Databases (SSTD). LNCS 3633, Heidelberg: Springer-Verlag, 2005. 181-199.
16. Gupta S, Kopparty S, Ravishankar C. Roads, codes, and spatiotemporal queries. In: Deutsch A, ed. Proc. of the 23rd ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems (PODS). New York: ACM Press, 2004. 115-124.
17. Papadias D, Zhang J, Mamoulis N, Tao Y. Query processing in spatial network databases. In: Freytag JC, Lockemann PC, Abiteboul S, Carey MJ, Selinger PG, Heuer A, eds. Proc. of the 29th Int'l Conf. on Very Large Data Bases (VLDB). San Fransisco: Morgan Kaufmann Publishers, 2003. 790-801.
18. Yiu ML, Mamoulis N, Papadias D. Aggregate nearest neighbor queries in road networks. IEEE Trans. on Knowledge and Data Engineering, 2005, 17 (6): 820-833.
19. Yiu ML, Papadias D, Mamoulis N, Tao Y. Reverse nearest neighbors in large graphs. IEEE Trans. on Knowledge and Data Engineering, 2006, 18 (4): 540-553.
20. Tung AKH, Hou J, Han JW. Spatial clustering in the presence of obstacles. In: Proc. of the 17th Int'l Conf. on Data Engineering (ICDE). Heidelberg: IEEE Computer Society, 2001. 359-367.