Spatiotemporal Data-Adaptive Clustering Algorithm: An Intelligent Computational Technique for City Big Data

Author(s):  
Geonhwa You
2021 ◽  
pp. 1-10
Author(s):  
Meng Huang ◽  
Shuai Liu ◽  
Yahao Zhang ◽  
Kewei Cui ◽  
Yana Wen

The integration of Artificial Intelligence technology and school education had become a future trend, and became an important driving force for the development of education. With the advent of the era of big data, although the relationship between students’ learning status data was closer to nonlinear relationship, combined with the application analysis of artificial intelligence technology, it could be found that students’ living habits were closely related to their academic performance. In this paper, through the investigation and analysis of the living habits and learning conditions of more than 2000 students in the past 10 grades in Information College of Institute of Disaster Prevention, we used the hierarchical clustering algorithm to classify the nearly 180000 records collected, and used the big data visualization technology of Echarts + iView + GIS and the JavaScript development method to dynamically display the students’ life track and learning information based on the map, then apply Three Dimensional ArcGIS for JS API technology showed the network infrastructure of the campus. Finally, a training model was established based on the historical learning achievements, life trajectory, graduates’ salary, school infrastructure and other information combined with the artificial intelligence Back Propagation neural network algorithm. Through the analysis of the training resulted, it was found that the students’ academic performance was related to the reasonable laboratory study time, dormitory stay time, physical exercise time and social entertainment time. Finally, the system could intelligently predict students’ academic performance and give reasonable suggestions according to the established prediction model. The realization of this project could provide technical support for university educators.


2021 ◽  
pp. 1-12
Author(s):  
Li Qian

In order to overcome the low classification accuracy of traditional methods, this paper proposes a new classification method of complex attribute big data based on iterative fuzzy clustering algorithm. Firstly, principal component analysis and kernel local Fisher discriminant analysis were used to reduce dimensionality of complex attribute big data. Then, the Bloom Filter data structure is introduced to eliminate the redundancy of the complex attribute big data after dimensionality reduction. Secondly, the redundant complex attribute big data is classified in parallel by iterative fuzzy clustering algorithm, so as to complete the complex attribute big data classification. Finally, the simulation results show that the accuracy, the normalized mutual information index and the Richter’s index of the proposed method are close to 1, the classification accuracy is high, and the RDV value is low, which indicates that the proposed method has high classification effectiveness and fast convergence speed.


2013 ◽  
Vol 660 ◽  
pp. 184-189 ◽  
Author(s):  
Yan Zhai ◽  
Xing Wei ◽  
Lei Liu ◽  
Liao Yuan Wu

In order to tackle the data transmission bottlenecks of the gateway node in clustering Ad hoc Networks, the paper proposes a communication method. Firstly, DMAC (Distributed and Mobility-Adaptive Clustering) algorithm and Omni-directional antenna is well introduced and discussed. Then the ICMMDA (The Inter-cluster Communication Method based on Directional Antennas) policy building virtual channels between two hops away cluster-head and using directional antenna is brought about. Lastly, the simulation shows that the method can reduce the end-to-end delay between two clusters and improve the network throughput.


2015 ◽  
Vol 30 (6) ◽  
pp. 1041-1071 ◽  
Author(s):  
Bi Yu Chen ◽  
Hui Yuan ◽  
Qingquan Li ◽  
Shih-Lung Shaw ◽  
William H.K. Lam ◽  
...  

2021 ◽  
Vol 14 (2) ◽  
pp. 26
Author(s):  
Na Li ◽  
Lianguan Huang ◽  
Yanling Li ◽  
Meng Sun

In recent years, with the development of the Internet, the data on the network presents an outbreak trend. Big data mining aims at obtaining useful information through data processing, such as clustering, clarifying and so on. Clustering is an important branch of big data mining and it is popular because of its simplicity. A new trend for clients who lack of storage and computational resources is to outsource the data and clustering task to the public cloud platforms. However, as datasets used for clustering may contain some sensitive information (e.g., identity information, health information), simply outsourcing them to the cloud platforms can't protect the privacy. So clients tend to encrypt their databases before uploading to the cloud for clustering. In this paper, we focus on privacy protection and efficiency promotion with respect to k-means clustering, and we propose a new privacy-preserving multi-user outsourced k-means clustering algorithm which is based on locality sensitive hashing (LSH). In this algorithm, we use a Paillier cryptosystem encrypting databases, and combine LSH to prune off some unnecessary computations during the clustering. That is, we don't need to compute the Euclidean distances between each data record and each clustering center. Finally, the theoretical and experimental results show that our algorithm is more efficient than most existing privacy-preserving k-means clustering.


2014 ◽  
Vol 2014 ◽  
pp. 1-19 ◽  
Author(s):  
Mark J. van der Laan ◽  
Richard J. C. M. Starmans

This outlook paper reviews the research of van der Laan’s group on Targeted Learning, a subfield of statistics that is concerned with the construction of data adaptive estimators of user-supplied target parameters of the probability distribution of the data and corresponding confidence intervals, aiming at only relying on realistic statistical assumptions. Targeted Learning fully utilizes the state of the art in machine learning tools, while still preserving the important identity of statistics as a field that is concerned with both accurate estimation of the true target parameter value and assessment of uncertainty in order to make sound statistical conclusions. We also provide a philosophical historical perspective on Targeted Learning, also relating it to the new developments in Big Data. We conclude with some remarks explaining the immediate relevance of Targeted Learning to the current Big Data movement.


2021 ◽  
Vol 2021 ◽  
pp. 1-16
Author(s):  
Huaiguang Liu ◽  
Liheng Zhang ◽  
Shiyang Zhou ◽  
Li Fang

The microstructure is the key factor for quality discriminate of coke. In view of the characteristics of coke optical tissue (COT), a segmentation method of coke microstructures based on adaptive clustering was proposed. According to the strategy of multiresolution, adaptive threshold binarization and morphological filtering were carried out on COT images with lower resolution. The contour of the COT body was detected through the relationship checking between contours in the binary image, and hence, COT pixels were picked out to cluster for tissue segmentation. In order to get the optimum segmentation for each tissue, an advanced K -means method with adaptive clustering centers was provided according to the Calinski-Harabasz score. Meanwhile, Euclidean distance was substituted with Mahalanobis distance between each pixel in HSV space to improve the accuracy. The experimental results show that compared with the traditional K -means algorithm, FCM algorithm, and Meanshift algorithm, the adaptive clustering algorithm proposed in this paper is more accurate in the segmentation of various tissue components in COT images, and the accuracy of tissue segmentation reaches 94.3500%.


Sign in / Sign up

Export Citation Format

Share Document