On the basis of the data set which can not be connecteel
the definitions of the compatible data set and incompatible data set 2 based on the data sets not to be connected are given
some basic theories about compatible data set are presented
an association rule mining programme based on compatible data set is proposed. It is realized that association rules of compatible data set mining merge directly
so that association rules of the whole compatible data set are generated and the algorithm can realize an association rule mining which cannot be realized by the common data mining. The algorithm expands the application field of association rule algorithm and improves the efficiency of data mining
meanwhile
it realized the privacy protection in a certain extent.
关键词
Keywords
references
Fan Wenfei, Geerts F. Relative information completeness[C]//Proc of the 28th ACM SIGMOD-SIGACT-SIGART Symp on Principles of Database Systems. NewYork: ACM, 2009: 97 -106