Mining of popular paths with privacy protection and its applications.

• Other Authors: Cheong, Chi Hong.
• Format: Others
• Language: English; Chinese
• Published: 2006
• Subjects: Data mining; Data protection; Computer algorithms; Smart cards > Programming; Intelligent transportation systems
• Online Access: http://library.cuhk.edu.hk/record=b5892943; http://repository.lib.cuhk.edu.hk/en/item/cuhk-325797

Cheong Chi Hong. === Thesis (M.Phil.)--Chinese University of Hong Kong, 2006. === Includes bibliographical references (leaves 81-86). === Abstracts in English and Chinese. === Abstract --- p.i === Acknowledgement --- p.v === Chapter 1 --- Introduction --- p.1 === Chapter 1.1 --- Problem statement --- p.1 === Chapter 1.2 --- Major contributions --- p.4 === Chapter 1.3 --- Thesis organization --- p.4 === Chapter 2 --- Smart Card System --- p.6 === Chapter 2.1 --- Introduction --- p.7 === Chapter 2.2 --- Related Work --- p.11 === Chapter 2.2.1 --- Mining Customer Behaviors --- p.11 === Chapter 2.2.2 --- Privacy Preserving Data Mining --- p.12 === Chapter 2.2.3 --- Definitions of Privacy --- p.13 === Chapter 2.3 --- Model --- p.14 === Chapter 2.4 --- Algorithms --- p.17 === Chapter 2.4.1 --- Baseline Algorithm --- p.17 === Chapter 2.4.2 --- Privacy Equation --- p.19 === Chapter 2.4.3 --- Random Subsequence Selection Algorithm (RSSA) --- p.20 === Chapter 2.4.4 --- Popular Item Selection Algorithm (PISA) --- p.21 === Chapter 2.5 --- Analysis --- p.26 === Chapter 2.5.1 --- Accuracy --- p.26 === Chapter 2.5.2 --- Analysis of RSSA: Determine te values --- p.27 === Chapter 2.5.3 --- Analysis of RSSA: Accuracy --- p.30 === Chapter 2.5.4 --- Analysis of PISA --- p.33 === Chapter 2.5.5 --- Theoretical Proof of PISA --- p.41 === Chapter 2.5.6 --- Privacy Protection --- p.42 === Chapter 2.6 --- Simulations --- p.45 === Chapter 3 --- Transportation System --- p.48 === Chapter 3.1 --- Introduction --- p.49 === Chapter 3.2 --- Related Work --- p.51 === Chapter 3.3 --- Model --- p.56 === Chapter 3.4 --- Algorithms --- p.60 === Chapter 3.5 --- Simulations --- p.63 === Chapter 4 --- Enhanced Features in a Smart Card System --- p.67 === Chapter 4.1 --- Adding Time Information --- p.68 === Chapter 4.1.1 --- Motivation --- p.68 === Chapter 4.1.2 --- Time Intervals --- p.68 === Chapter 4.1.3 --- Original Graph --- p.69 === Chapter 4.1.4 --- New Graph --- p.70 === Chapter 4.1.5 --- Adding the New Graph into the Model --- p.72 === Chapter 4.1.6 --- Rewriting the Definition of a Path --- p.73 === Chapter 4.1.7 --- Drawback of Adding Time Information --- p.73 === Chapter 4.2 --- Generalization --- p.75 === Chapter 4.2.1 --- Motivation --- p.75 === Chapter 4.2.2 --- Generalization --- p.75 === Chapter 4.3 --- Specialization vs. Generalization --- p.75 === Chapter 5 --- Conclusion --- p.79 === Bibliography --- p.81