𝔖 Bobbio Scriptorium
✦   LIBER   ✦

[Studies in Computational Intelligence] Soft Computing for Data Mining Applications Volume 190 || Dynamic Association Rule Mining Using Genetic Algorithms

✍ Scribed by Venugopal, K. R.


Book ID
118229471
Publisher
Springer Berlin Heidelberg
Year
2009
Tongue
German
Weight
253 KB
Category
Article
ISBN
3642001939

No coin nor oath required. For personal study only.

✦ Synopsis


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.


πŸ“œ SIMILAR VOLUMES


[Lecture Notes in Computer Science] Adva
✍ Whang, Kyu-Young; Jeon, Jongwoo; Shim, Kyuseok; Srivastava, Jaideep πŸ“‚ Article πŸ“… 2003 πŸ› Springer Berlin Heidelberg 🌐 English βš– 183 KB

The 7th Paci?c Asia Conference on Knowledge Discovery and Data Mining (PAKDD) was held from April 30 to May 2, 2003 in the Convention and Ex- bition Center (COEX), Seoul, Korea. The PAKDD conference is a major forum for academic researchers and industry practitioners in the Paci?c Asia region to sha

[Lecture Notes in Computer Science] Adva
✍ Tang, Jie; King, Irwin; Chen, Ling; Wang, Jianyong πŸ“‚ Article πŸ“… 2011 πŸ› Springer Berlin Heidelberg 🌐 English βš– 712 KB

The two-volume set LNAI 7120 and LNAI 7121 constitutes the refereed proceedings of the 7th International Conference on Advanced Data Mining and Applications, ADMA 2011, held in Beijing, China, in December 2011. The 35 revised full papers and 29 short papers presented together with 3 keynote speeches