Zobrazeno 1 - 1
of 1
pro vyhledávání: '"賴貞汝"'
Autor:
Chen-Ju Lai, 賴貞汝
102
In this paper, we propose an approach integrating frequent pattern clustering and branch-and-bound algorithms to find an optimal database partition. First, the Apriori algorithm and cosine similarity are used to find out weighted frequent pa
In this paper, we propose an approach integrating frequent pattern clustering and branch-and-bound algorithms to find an optimal database partition. First, the Apriori algorithm and cosine similarity are used to find out weighted frequent pa
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/20141759777742969238
