Titlebook: Big Data; 7th CCF Conference, Hai Jin,Xuemin Lin,Yihua Huang Conference proceedings 2019 Springer Nature Singapore Pte Ltd. 2019 artificia

朋黨派系

bleach

orthopedist

A Distributed Big Data Discretization Algorithm Under Sparkcy and time performance of the subsequent learning process. In the era of big data, the traditional discretization method is no longer applicable and distributed discretization algorithms need to be designed. Hellinger-entropy as an important distance measurement method in information theory is cont

hair-bulb

使混合

Considering User Distribution and Cost Awareness to Optimize Server Deployment of Things (IoT) applications and balance the sever utilization. Hence, this paper proposes a cost-aware edge server optimization deployment method. Firstly, we model the edge server placement problem as a Mixed Integer Nonlinear Programming problem (MNIP), which comprehensively considers the resour

薄荷醇

閃光你我

vibrant

Clustering-Anonymization-Based Differential Location Privacy Preserving Protocol in WSNthe vital data in transmission is widely used in detecting and routing for the network. With the big data mining and analysis, the security of location and data privacy in WSN faces great challenges. To the problem of active attacking like node capture in wireless sensor network node location privac

平庸的人或物

Distributed Graph Perturbation Algorithm on Social Networks with Reachability Preservationmethods is limited. Node reachability query is essential in directed graphs, which can reflect the relationship between nodes and the direction of information dissemination. Aiming at the problem of the reachability of nodes between directed social network privacy technologies, this paper proposes a

甜食

Minimum Spanning Tree Clustering Based on Density Filteringsity, we propose a new clustering approach: minimum spanning tree clustering based on density filtering. It masks the low-density points in the density filtering step, which reduces the interference of noise and makes the gap between clusters clearer. It uses relative values of adjacent distances to