Rule based prediction of fastest paths on urban networks

IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC

Volumn 2005, Issue , 2005, Pages 978-983

  Awasthi, Anjali ^a   Lechevallier, Yves ^b   Parent, Michel ^b   Proth, Jean Marie ^c  

^a EIGSI La Rochelle   (France)

^b INRIA ROCQUENCOURT   (France)

^c UNIVERSITÉ DE LORRAINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DATA FLOW ANALYSIS; HIGHWAY TRAFFIC CONTROL; INTELLIGENT VEHICLE HIGHWAY SYSTEMS; LOGIC PROGRAMMING; STATISTICAL METHODS; URBAN PLANNING;

HYBRID CLUSTERING; MULTIPLE CORRESPONDENCE ANALYSIS; URBAN NETWORKS;

TRANSPORTATION ROUTES;

EID: 33747400936     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITSC.2005.1520183     Document Type: Conference Paper

References (23)

1. Zhan Benjamin F.(1997), Three Fastest Shortest Path Algorithms on Real Road Networks: Data Structures and Procedures, Journal of Geographic Information and Decision Analysis, vol.1, no.1, pp. 70-82.
2. Smith R., Chou J. and Romeijn E.(1998), Approximating Shortest Paths in Large Scale Networks with Application to Intelligent Transportation Systems, INFORMS Journal on Computing, 10, no. 2, 163-179.
3. Cutting, D., Karger, D., Pedersen, J., and Tukey, J. W. (1992), Scatter/Gather: a cluster based approach to browsing large document collections, In Proc. 15th Annual Int. ACM SIGIR Conf., Copenhagen.
4. Marcotorchino J.F., Proth J.M., et Janesen J., editors, Data analysis in real life environments, North Holland, Amsterdam, 1985.
5. Diday E. and Simon J.C. (1976), Clustering Analysis,. In : Fu, K. S. (Eds.): Digital Pattern Recognition, Springer-Verlag, Heidelberg, 47-94.
6. Murtagh F, (1995), Interpreting the Kohonen self-organizing feature map using contiguity-constrained clustering. Pattern Recognition Letters, 16, 399-408.
7. Kohonen T. (1988), Self organization and associative memory, 2nd edition, Springer-Verlag, Berlin, Germany.
8. Ambroise, C., Badran F., Thiria S., and Sèze G, (2000), Hierarchical Clustering of Self-Organizing Maps for Cloud Classification, Neurocomputing, 30 (1-4), pp. 47-52,.
9. Park D. and Rillett L. R. (1998), Forecasting multiple period freeway link travel times using modular neural networks. Transportation Research Record, 1617, National Research Council., Washington D.C.
10. Dougherty M.S. (1995), A review of neural networks applied to transport, Transportation Research, 3 C(4), pp 247-260.
11. Kisgyorgy L., Rillett L. R. (2002), Travel Time prediction by advanced neural network, Periodica Polytechnica Ser Civil Engineering, Vol 46, No. 1, pp 15-32.
12. Jain A. K., Murty M. N. and Flynn P. J. (1999), Data Clustering: A Review, ACM Computing Surveys, Vol. 31, No. 3, September.
13. Everitt B.S. (1974), Cluster Analysis, Heinemann Educational Books.
14. Meila, M. and Heckerman, D.(1998), An experimental comparison of several clustering and initialization methods, In Proc. Uncertainty in Artificial Intelligence, 386-395.
15. Diday, E., Govaert, G., Lechevallier, Y. and Sidi, J. (1978), Clustering in pattern recognition, in 4th International Joint Conference on Pattern Recognition, Kyoto, Japan.
16. Diday E., Lemaire J., Pouget P. et Testu F., Elements danalyse des donnes. Dunod. Paris, 1983.
17. Tomassone R., Danzart M., Daudin J.J. et Masson J.P., Discrimination et classement, Masson, Paris, 1988.
18. Roux M., Algorithmes de classification, Masson, Paris, 1986.
19. Hansen P., et Jaumard B., Cluster analysis and mathematical programming, Mathematical Programming, 79, pp 191-215 (1997).
20. Klein G et Aronson J.E. (1991), Optimal Clustering: a model and method, Naval research Logistics. 38, 447-461.
21. CISIA (1997), SPAD Reference Manuals, Centre International de Statistique et d'Informatique Appliquées, France 1997.
22. Legendre P., Program K-means, 2001, http://www.fas.umontreal.ca/biol/ legendre/
23. Ward J, H. (1963), Hierarchical grouping to optimize an objective function, Journal of the American Statistical Association, 58, 236-244.