數(shù)據(jù)挖掘和數(shù)據(jù)融合中的幾個(gè)問題.pdf_第1頁
已閱讀1頁,還剩158頁未讀, 繼續(xù)免費(fèi)閱讀

下載本文檔

版權(quán)說明:本文檔由用戶提供并上傳,收益歸屬內(nèi)容提供方,若內(nèi)容存在侵權(quán),請(qǐng)進(jìn)行舉報(bào)或認(rèn)領(lǐng)

文檔簡介

1、Data mining is most promising and flourishing frontier in database system. Data mining, also popularly referred to as Knowledge discovery in Database (KDD), is the automated convenient extraction of patterns representing

2、 knowledge implicitly stored in large database, datahouses, and other massive information repositories. Our capabilities of both generating and collecting data have been increasing rapidly in the last several decades. Co

3、ntributing factors include the widespread use of bar codes for most commercial products, the computerization of many business, scientific, and government transactions, and advances in data collection tools ranging from s

4、canned text and image platforms to satellite remote sensing systems. In addition, popular use of the Word Wide web as a global information system has flooded us with a tremendous amount of data and information. This expl

5、osive growth in stored data has generated an urgent need for new techniques and automated tools that can intelligently assist us in transforming the vast amounts of data into useful information and knowledge. Cluster

6、ing is main tool in data mining. Clustering algorithms try to partition a set of unlabeled input vectors into a number of subsets (clusters) such that data in the same subset are more similar to each other than to data i

7、n other subsets. There are two kinds of unsupervised clustering algorithms: fuzzy versus crisp. Crisp clustering assign any vector to unique cluster while fuzzy clustering allows the vector to belong to several clusters

8、in different membership degrees. The study develops several fast crisp clustering approaches such as cover-based, grid-based, and kernel- based ones to challenge these open problems: how can a clusteringapproach assess t

9、hose arbitrary-shaped and density-skewed clusters? Also, how one can obtain a fast approach to clustering in linear complexity? In addition, fuzzy clustering and approximation possess special position in data mining when

10、 the unlabeled vectors have uncertainty. We probe its clustering mechanism and applicable fields. Choquet fuzzy integral has become more and more popular fusion approach. As being based on the fuzzy measure, however,

11、 two main problems arise when using fuzzy measures in practical application. One is the lack of a clear understanding about the meaning of the measures; until now, no consensus has been reached about what the numbers mea

12、n. The other problem is that typically it is not possible to get a complete specification of the value of the measure for all the subsets in the domain, but for a reduced number of them. To solve these problems, we propo

13、se several design including that an approach based on TS fuzzy modeling uses for the parameter estimation of Choquet fuzzy integral of fuzzy measure in it, some new fuzzy integral model is contributed to increase the fle

14、xibility of original ones. Finally, we discover several characters of the existed calculating methods for the Choquet fuzzy integral fuzzy and analyzes the neural network structure consisting of Choquet fuzzy integral un

溫馨提示

  • 1. 本站所有資源如無特殊說明,都需要本地電腦安裝OFFICE2007和PDF閱讀器。圖紙軟件為CAD,CAXA,PROE,UG,SolidWorks等.壓縮文件請(qǐng)下載最新的WinRAR軟件解壓。
  • 2. 本站的文檔不包含任何第三方提供的附件圖紙等,如果需要附件,請(qǐng)聯(lián)系上傳者。文件的所有權(quán)益歸上傳用戶所有。
  • 3. 本站RAR壓縮包中若帶圖紙,網(wǎng)頁內(nèi)容里面會(huì)有圖紙預(yù)覽,若沒有圖紙預(yù)覽就沒有圖紙。
  • 4. 未經(jīng)權(quán)益所有人同意不得將文件中的內(nèi)容挪作商業(yè)或盈利用途。
  • 5. 眾賞文庫僅提供信息存儲(chǔ)空間,僅對(duì)用戶上傳內(nèi)容的表現(xiàn)方式做保護(hù)處理,對(duì)用戶上傳分享的文檔內(nèi)容本身不做任何修改或編輯,并不能對(duì)任何下載內(nèi)容負(fù)責(zé)。
  • 6. 下載文件中如有侵權(quán)或不適當(dāng)內(nèi)容,請(qǐng)與我們聯(lián)系,我們立即糾正。
  • 7. 本站不保證下載資源的準(zhǔn)確性、安全性和完整性, 同時(shí)也不承擔(dān)用戶因使用這些下載資源對(duì)自己和他人造成任何形式的傷害或損失。

最新文檔

評(píng)論

0/150

提交評(píng)論