咨询与建议

看过本文的还看了

相关文献

该作者的其他文献

文献详情 >Compression Schemes for Mining... 收藏

Compression Schemes for Mining Large Datasets: A Machine Learning Perspective

丛 书 名:Advances in Computer Vision and Pattern Recognition

版本说明:1

作     者:T. Ravindra Babu, M. Narasimha Murty, S.V. Subrahmanya (auth.) 

I S B N:(纸本) 9781447156062;9781447156079 

出 版 社:Springer-Verlag London 

出 版 年:2013年

页      数:208页

摘      要:This book addresses the challenges of data abstraction generation using a least number of database scans, compressing data through novel lossy and non-lossy schemes, and carrying out clustering and classification directly in the compressed domain. Schemes are presented which are shown to be efficient both in terms of space and time, while simultaneously providing the same or better classification accuracy. Features:describes a non-lossy compression scheme based on run-length encoding of patterns with binary valued features; proposes a lossy compression scheme that recognizes a pattern as a sequence of features and identifying subsequences; examines whether the identification of prototypes and features can be achieved simultaneously through lossy compression and efficient clustering; discusses ways to make use of domain knowledge in generating abstraction; reviews optimal prototype selection using genetic algorithms; suggests possible ways of dealing with big data problems using multiagent systems.

读者评论 与其他读者分享你的观点

用户名:未登录
我的评分