Font Size: a A A

The Research And Application Of Data Mining Based On Grid-Density

Posted on:2004-01-04Degree:MasterType:Thesis
Country:ChinaCandidate:R B BianFull Text:PDF
GTID:2168360092481884Subject:Systems analysis and integration
Abstract/Summary:PDF Full Text Request
This paper introduces the development of data mining and the concepts and techniques about clustering will be discussed, and also mainly discusses the algorithm of cluster based on grid-density, then the algorithm will be applied to the system of insurance ?Among the various algorithms of cluster put forward, they are usually based on the concepts of distance cluster o Whether it is in the sense of traditional Eculid distance such as "k-means" or others o These algorithms are usually inefficient when dealing with large data sets and data sets of high dimension and different kinds of attribute o Further more, the number of clusters they can find usually depends on users' input 0 But this task is often a very tough one for the user0 At the same time , different inputs will have great effect on the veracity of the cluster's result 0 In this paper the algorithm of cluster based on grid-density will be discussed o It gives up the concepts of distance <, It can automatically find out all clusters in that subspaceo At the same time , it performs well when dealing with high dimensional data and has good scalability when the size of the data sets increases o...
Keywords/Search Tags:DataMining, Cluster, GricU Density, High Dimension Data, Subspace, Minimal Description Length, Greedy growth algorithm
PDF Full Text Request
Related items