Return
Data mining in distributed environment: a survey
DOI:10.1002/widm.1216.png)
Abstract
En 中文
Due to the rapid growth of resource sharing, distributed systems are developed, which can be used to utilize the computations. Data mining (DM) provides powerful techniques for finding meaningful and useful information from a very large amount of data, and has a wide range of real-world applications. However, traditional DM algorithms assume that the data is centrally collected, memory-resident, and static. It is challenging to manage the large-scale data and process them with very limited resources. For example, large amounts of data are quickly produced and stored at multiple locations. It becomes increasingly expensive to centralize them in a single place. Moreover, traditional DM algorithms generally have some problems and challenges, such as memory limits, low processing ability, and inadequate hard disk, and so on. To solve the above problems, DM on distributed computing environment [also called distributed data mining (DDM)] has been emerging as a valuable alternative in many applications. In this study, a survey of state-of-the-art DDM techniques is provided, including distributed frequent item-set mining, distributed frequent sequence mining, distributed frequent graph mining, distributed clustering, and privacy preserving of distributed data mining. We finally summarize the opportunities of data mining tasks in distributed environment. (C) 2017Wiley Periodicals, Inc.
Keywords:
K-MEANS
SEQUENTIAL PATTERNS
FREQUENT PATTERNS
ASSOCIATION RULES
PARALLEL
PRIVACY
EFFICIENT
ALGORITHM
ITEMSETS
GENERATION
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
11.7
Papers:
546
Citations:
5.3K

