Credibility assessment in an on-line car navigation system by means of the expectation maximization algorithm

• Autorzy: Kubiak M.
• Języki publikacji: EN

Abstrakty

EN

In an on-line car satellite navigation system users may communicate with the system's operator and send them information about some objects in a road network, e.g. dangerous places or safety cameras. The operator of such a system may publish this information for the benefit of other users, but firstly has to assess the credibility of the submitted information. The paper presents a probabilistic model of such a scenario- It investigates the possibility of estimating probabilities of objects' existence and users' credibilities based only on data provided by the users. This estimation is performed by the Expectation Maximization algorithm. The proposed approach is compared to a voting method in a simulation study, which is the first step required by an industrial partner toward a commercial application.

Słowa kluczowe

EN

satellite car navigation; probabilistic model; estimation; expectation maximization

• Wydawca: Wydawnictwo Politechniki Poznańskiej
• Czasopismo: Foundations of Computing and Decision Sciences
• Rocznik: 2007
• Tom: Vol. 32, No. 4
• Strony: 275--293
• Opis fizyczny: Bibliogr. 12 poz.

Twórcy

autor

Kubiak M.

• Poznan University of Technology, Institute of Computing Science, Piotrowo 2, 60-965 Poznań, Poland,

Bibliografia

• [1] Brin S., Page L., The anatomy of a large-scale hypertextual Web search engine, in: Proceedings of the Seventh International Conference on World Wide Web, 1998, 107-117.
• [2] Carbo J.. Molina J. M., Davila J., Trust management through fuzzy reputation. International Journal of Cooperative Information Systems, 12. 1, 2003, 135-155.
• [3] Dempster A. P.. Laird N. M.. Rubin D. B.. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, Series B. 39, L 1977, 1-38.
• [4] Feller W., An Introduction to Probability Theory and Its Applications, John \Viley and Sons. New York. London. 1961.
• [5] Kamwar S. D., Schlosser M. T.. Garcia-Molina H., The EigenTrust algorithm for reputation management in P2P networks, in: The Twelfth International World Wide Web Conference. Budapest. Hungary, 2003.
• [6] Morzy M.. Jezierski J.. Cluster-based analysis and recommendation of sellers in online auctions, in: Trust and Privacy in Digital Business, Lecture Notes in Computer Science, 4083, Springer, 2006, 172-181.
• [7] Patel J-, Teacy W. T. L.. Jennings N. R., Luck M., A probabilistic trust model for handling inaccurate reputation sources, in: Proceedings of Third International Conference on Trust Management, Rocquencourt, France, 2005, 193-209.
• [8] Pujol J. M.. Sanguesa R., Delgado J-, Extracting reputation in multi agent systems by means of social network topology, in: Proceedings of the First International Joint Conference on Autonomous Agents and Multiagent Systems: Part L Bologna, Italy, 2002.
• [9] Salacka S.. Inteligentny system poradzi, jak ominąć korki (in Polish), Gazeta Wyborcza Poznań. August 3rd, 2007.
• [10] Sneath P. H., Sokal R. R.. Numerical Taxonomy. Freeman £: Co., San Francisco, 1973.
• [11] Xiong L., Liii L., A reputation-based trust model for peer-to-peer ecommerce communities, in: Proceedings of the Ath ACM conference on Electronic Commerce, San Diego, CA, USA, 2003, 228-229.
• [12] Zacharia G., Maes P.. Trust management through reputation mechanisms. Applied Artificial Intelligence, 14, 9. 2000, 881-907.