Harnessing the strengths of anytime algorithms for constant data streams

ISSN： 1384-5810

Source： Data Mining and Knowledge Discovery, Vol.19, Iss.2, 2009-10, pp. : 245-260

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A survey on algorithms for mining frequent itemsets over data streams

By Cheng James Ke Yiping Ng Wilfred

Knowledge and Information Systems, Vol. 16, Iss. 1, 2008-07 ,pp. : 1-27

Springer Publishing Company

Access to resources Recommend Favorite

USING EVOLUTIONARY ALGORITHMS TO OPTIMIZE ANTHROPOGENIC MATERIAL STREAMS

By Pollmann Olaf

Applied Artificial Intelligence, Vol. 23, Iss. 9, 2009-10 ,pp. : 883-893

Taylor & Francis Ltd

Access to resources Recommend Favorite

Distributed clustering of ubiquitous data streams

WILEY INTERDISCIPLINARY REVIEWS: DATA MINING AND KNOWLEDGE DISCOVERY (ELECTRONIC), Vol. 4, Iss. 1, 2014-01 ,pp. : 38-54

John Wiley & Sons Inc

Access to resources Recommend Favorite

Constant factor approximation algorithms for coalition structure generation

By Service Travis Adams Julie

Autonomous Agents and Multi-Agent Systems, Vol. 23, Iss. 1, 2011-07 ,pp. : 1-17

Springer Publishing Company

Access to resources Recommend Favorite

On High Dimensional Projected Clustering of Data Streams

By Aggarwal Charu Han Jiawei Wang Jianyong Yu Philip

Data Mining and Knowledge Discovery, Vol. 10, Iss. 3, 2005-05 ,pp. : 251-273

Springer Publishing Company

Access to resources Recommend Favorite