Mendeley出力
Data Mining in Crystallography / edited by D. W. M. Hofmann, Liudmila N. Kuleshova
(Structure and Bonding. ISSN:00815993 ; 134)
| データ種別 | 電子ブック |
|---|---|
| 著者標目 | Hofmann, D. W. M editor Kuleshova, Liudmila N editor SpringerLink (Online service) |
| 出版者 | (Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer) |
| 出版年 | 2010 |
書誌詳細を非表示
| 巻次 | ISBN:9783642047596 |
|---|---|
| 大きさ | XIV, 172 p. 74 illus., 29 illus. in color : online resource |
| 一般注記 | An Introduction to Data Mining -- Data Mining in Organic Crystallography -- Data Mining for Protein Secondary Structure Prediction -- Data Mining and Inorganic Crystallography -- Data Bases, the Base for Data Mining Humans have been “manually” extracting patterns from data for centuries, but the increasing volume of data in modern times has called for more automatic approaches. Early methods of identifying patterns in data include Bayes’ theorem (1700s) and Regression analysis (1800s). The proliferation, ubiquity and incre- ing power of computer technology has increased data collection and storage. As data sets have grown in size and complexity, direct hands-on data analysis has - creasingly been augmented with indirect, automatic data processing. Data mining has been developed as the tool for extracting hidden patterns from data, by using computing power and applying new techniques and methodologies for knowledge discovery. This has been aided by other discoveries in computer science, such as Neural networks, Clustering, Genetic algorithms (1950s), Decision trees (1960s) and Support vector machines (1980s). Data mining commonlyinvolves four classes of tasks: • Classi cation: Arranges the data into prede ned groups. For example, an e-mail program might attempt to classify an e-mail as legitimate or spam. Common algorithmsinclude Nearest neighbor,Naive Bayes classi er and Neural network. • Clustering: Is like classi cation but the groups are not prede ned, so the algorithm will try to group similar items together. • Regression: Attempts to nd a function which models the data with the least error. A common method is to use Genetic Programming. • Association rule learning: Searches for relationships between variables. For example, a supermarket might gather data of what each customer buys HTTP:URL=http://dx.doi.org/10.1007/978-3-642-04759-6 |
| 件 名 | LCSH:Chemistry LCSH:Inorganic chemistry LCSH:Proteins FREE:Chemistry FREE:Inorganic Chemistry FREE:Crystallography and Scattering Methods FREE:Protein Structure |
| 分 類 | LCC:QD146-197 DC23:546 |
| 書誌ID | OB00007176 |
| ISBN | 9783642047596 |