Abstract

Mining for clusters in a database with uncertain data is a hot topic in many application areas, such as sensor database, location database, face recognition system and so on. Since it is commonly assumed that most of the objects which are contained in a high-dimensional dataset are located in a low-dimensional sub-space, mining clusters in a subspace in an uncertain database is a new task. In this paper, we adopt and combine fractal correlation dimension with fuzzy distance function to find out the clusters in a low-dimensional subspace in an uncertain database. We also propose the fuzzy kth NN algorithm to retrieve the kth nearest neighbor which can accelerate the process of mining. The experiments show that the new algorithm works well in an uncertain database

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.