{"title":"具有隐私保护的交通数据库系统中流行路径的挖掘","authors":"Chi Hong Cheong, M. Wong","doi":"10.1109/ICDEW.2006.91","DOIUrl":null,"url":null,"abstract":"This paper proposes an algorithm to identify popular paths in a transportation system, while the privacy of drivers is preserved. A popular path is one of the most frequently used routes between any two points in a road map. In order to identify popular paths with privacy protection, the algorithm figures out what information is useless for identifying popular paths, and this information is not revealed to the data mining system so that privacy is preserved. In addition, the system does not record the identifications of the vehicles. Moreover, in the mining process, the database does not contain complete path information. The experimental results verify the correctness of the proposed algorithm and show that the proposed algorithm is scalable.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Mining Popular Paths in a Transportation Database System with Privacy Protection\",\"authors\":\"Chi Hong Cheong, M. Wong\",\"doi\":\"10.1109/ICDEW.2006.91\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes an algorithm to identify popular paths in a transportation system, while the privacy of drivers is preserved. A popular path is one of the most frequently used routes between any two points in a road map. In order to identify popular paths with privacy protection, the algorithm figures out what information is useless for identifying popular paths, and this information is not revealed to the data mining system so that privacy is preserved. In addition, the system does not record the identifications of the vehicles. Moreover, in the mining process, the database does not contain complete path information. The experimental results verify the correctness of the proposed algorithm and show that the proposed algorithm is scalable.\",\"PeriodicalId\":331953,\"journal\":{\"name\":\"22nd International Conference on Data Engineering Workshops (ICDEW'06)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-04-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"22nd International Conference on Data Engineering Workshops (ICDEW'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDEW.2006.91\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDEW.2006.91","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Mining Popular Paths in a Transportation Database System with Privacy Protection
This paper proposes an algorithm to identify popular paths in a transportation system, while the privacy of drivers is preserved. A popular path is one of the most frequently used routes between any two points in a road map. In order to identify popular paths with privacy protection, the algorithm figures out what information is useless for identifying popular paths, and this information is not revealed to the data mining system so that privacy is preserved. In addition, the system does not record the identifications of the vehicles. Moreover, in the mining process, the database does not contain complete path information. The experimental results verify the correctness of the proposed algorithm and show that the proposed algorithm is scalable.