Extensions to the k-Means Algorithm for Clustering Large Data Sets with Categorical Values
Data Mining and Knowledge Discovery
Protecting data privacy through hard-to-reverse negative databases
International Journal of Information Security
Anonymous Data Collection in Sensor Networks
MOBIQUITOUS '07 Proceedings of the 2007 Fourth Annual International Conference on Mobile and Ubiquitous Systems: Networking&Services (MobiQuitous)
A biologically inspired password authentication system
Proceedings of the 5th Annual Workshop on Cyber Security and Information Intelligence Research: Cyber Security and Information Intelligence Challenges and Strategies
Generating hard satisfiable formulas by hiding solutions deceptiveily
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Generating hard satisfiable formulas by hiding solutions deceptively
Journal of Artificial Intelligence Research
Negative representations of information
International Journal of Information Security
Negative databases for biometric data
Proceedings of the 12th ACM workshop on Multimedia and security
Password Security through Negative Filtering
EST '10 Proceedings of the 2010 International Conference on Emerging Security Technologies
Privacy-aware collection of aggregate spatial data
Data & Knowledge Engineering
Everything that is not important: Negative databases [Research Frontier]
IEEE Computational Intelligence Magazine
Hi-index | 0.00 |
Recently, negative databases (NDBs) are proposed for privacy protection. Similar to the traditional databases, some basic operations could be conducted over the NDBs, such as select, intersection, update, delete and so on. However, both classifying and clustering in negative databases have not yet been studied. Therefore, two algorithms, i.e., a k nearest neighbor (kNN) classification algorithm and a k-means clustering algorithm in NDBs, are proposed in this paper, respectively. The core of these two algorithms is a novelmethod for estimating the Hamming distance between a binary string and an NDB. Experimental results demonstrate that classifying and clustering in NDBs are promising.