Soft computing for data mining applications
著者
書誌事項
Soft computing for data mining applications
(Studies in computational intelligence, v. 190)
Springer, c2009
大学図書館所蔵 全3件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical references
内容説明・目次
内容説明
The authors have consolidated their research work in this volume titled Soft Computing for Data Mining Applications. The monograph gives an insight into the research in the ?elds of Data Mining in combination with Soft Computing methodologies. In these days, the data continues to grow - ponentially. Much of the data is implicitly or explicitly imprecise. Database discovery seeks to discover noteworthy, unrecognized associations between the data items in the existing database. The potential of discovery comes from the realization that alternate contexts may reveal additional valuable information. The rate at which the data is storedis growing at a phenomenal rate. Asaresult,traditionaladhocmixturesofstatisticaltechniquesanddata managementtools are no longer adequate for analyzing this vast collection of data. Severaldomainswherelargevolumesofdataarestoredincentralizedor distributeddatabasesincludesapplicationslikeinelectroniccommerce,bio- formatics, computer security, Web intelligence, intelligent learning database systems,?nance,marketing,healthcare,telecommunications,andother?elds. E?cient tools and algorithms for knowledge discovery in large data sets have been devised during the recent years. These methods exploit the ca- bility of computers to search huge amounts of data in a fast and e?ective manner. However,the data to be analyzed is imprecise and a?icted with - certainty. In the case of heterogeneous data sources such as text and video, the data might moreover be ambiguous and partly con?icting. Besides, p- terns and relationships of interest are usually approximate. Thus, in order to make the information mining process more robust it requires tolerance toward imprecision, uncertainty and exceptions.
目次
Self Adaptive Genetic Algorithms.- Characteristic Amplification Based Genetic Algorithms.- Dynamic Association Rule Mining Using Genetic Algorithms.- Evolutionary Approach for XML Data Mining.- Soft Computing Based CBIR System.- Fuzzy Based Neuro - Genetic Algorithm for Stock Market Prediction.- Data Mining Based Query Processing Using Rough Sets and GAs.- Hashing the Web for Better Reorganization.- Algorithms for Web Personalization.- Classifying Clustered Webpages for Effective Personalization.- Mining Top - k Ranked Webpages Using SA and GA.- A Semantic Approach for Mining Biological Databases.- Probabilistic Approach for DNA Compression.- Non-repetitive DNA Compression Using Memoization.- Exploring Structurally Similar Protein Sequence Motifs.- Matching Techniques in Genomic Sequences for Motif Searching.- Merge Based Genetic Algorithm for Motif Discovery.
「Nielsen BookData」 より