Finding Main Causes of Elevator Accidents via Multi-Dimensional Association Rule in Edge Computing Environment

In order to discover the main causes of elevator group accidents in edge computing environment, a multi-dimensional data model of elevator accident data is established by using data cube technology, proposing and implementing a method by combining classical Apriori algorithm with the model, digging out frequent items of elevator accident data to explore the main reasons for the occurrence of elevator accidents. In addition, a collaborative edge model of elevator accidents is set to achieve data sharing, making it possible to check the detail of each cause to confirm the causes of elevator accidents. Lastly the association rules are applied to find the law of elevator Accidents.

An Algorithm Based on Markov Chain to Improve Edge Cache Hit Ratio for Blockchain-Enabled IoT

Reasonable allocation of storage and computing resources is the basis of building big data system.With the development of IoT(Internet of Things),more data will be brought.A three-layer architecture includes smart devices layer,edge cloud layer and blockchain-based distributed cloud layer.Blockchain is used in IoT for building a distributed decentralize P2P architecture to deal with the secure issue while edge computing deals with increasing volume of data.Edge caching is one of the important application scenarios.In order to allocate edge cache resources reasonably,to improve the quality of service and to reduce the waste of bandwidth resources,this paper proposes a content selection algorithm of edge cache nodes.The algorithm adopts markov chain model,improves the utilization of cache space and reduces the content transmission delay.The hierarchical caching strategy is adopted and the secondary cache stores slides of contents to expand the coverage of cached content and to reduce user waiting time.Regional node cooperation is adopted to expand the cache space and to support the regional preference of cache content.Compared with the classical substitution algorithm,simulation results show that the algorithm in this paper has higher cache hit ratio and higher space utilization.

Fog Computing Architecture-Based Data Acquisition for WSN Applications

Efficient and effective data acquisition is of theoretical and practical importance in WSN applications because data measured and collected by WSN is often unreliable, such as those often accompanied by noise and error, missing values or inconsistent data. Motivated by fog computing, which focuses on how to effectively offload computation-intensive tasks from resource-constrained devices, this paper proposes a simple but yet effective data acquisition approach with the ability of filtering abnormal data and meeting the real-time requirement. Our method uses a cooperation mechanism by leveraging on both an architectural and algorithmic approach. Firstly, the sensor node with the limited computing resource only accomplishes detecting and marking the suspicious data using a light weight algorithm. Secondly, the cluster head evaluates suspicious data by referring to the data from the other sensor nodes in the same cluster and discard the abnormal data directly. Thirdly, the sink node fills up the discarded data with an approximate value using nearest neighbor data supplement method. Through the architecture, each node only consumes a few computational resources and distributes the heavily computing load to several nodes. Simulation results show that our data acquisition method is effective considering the real-time outlier filtering and the computing overhead.

Textual-geographical-social aware point-of-interest recommendation

The rapid development of location-based social networks（LBSNs） has provided an unprecedented opportunity for better location-based services through point-of-interest（POI） recommendation. POI recommendation is personalized, location-aware, and context depended. However, extreme sparsity of user-POI matrix creates a severe challenge. In this paper we propose a textual-geographical-social aware probabilistic matrix factorization method for POI recommendation. Our model is textual-geographical-social aware probabilistic matrix factorization called TGS-PMF, it exploits textual information, geographical information, social information, and incorporates these factors effectively. First, we exploit an aggregated latent Dirichlet allocation（LDA） model to learn the interest topics of users and infer the interest POIs by mining textual information associated with POIs and generate interest relevance score. Second, we propose a kernel estimation method with an adaptive bandwidth to model the geographical correlations and generate geographical relevance score. Third, we build social relevance through the power-law distribution of user social relations to generate social relevance score. Then, our exploit probabilistic matrix factorization model（PMF） to integrate the interest, geographical, social relevance scores for POI recommendation. Finally, we implement experiments on a real LBSN check-in dataset. Experimental results show that TGS-PMF achieves significantly superior recommendation quality compared to other state-of-the-art POI recommendation techniques.

QoS prediction algorithm used in location-aware hybrid Web service

Quality-of-Service （QoS） describes the non-functional characteristics of Web services. As such, the QoS is a critical parameter in service selection, composition and fault tolerance, and must be accurately determined by some type of QoS prediction method. However, with the dramatic increase in the number of Web services, the prediction failure caused by data sparseness has become a critical challenge. A new ＇hybrid user-location-aware prediction based on weighted Adamic-Adar （WAA）＇ （HUWAA） was proposed. The implicit neighbor search was optimized by incorporating location factors. Meanwhile, the ability of the improved algorithms to solve the data sparsity problem was validated in experiments on public real world datasets. The new algorithm outperforms the existing of item-based pearson correlation coefficient （IPCC）, user-based pearson correlation coefficient （UPCC） and Web service recommender system （WSRec） algorithms.

Social media mining and visualization for point-o f-interest recommendation

With the rapid growth of location-based social networks （LBSNs）, point-of-interest （POI） recommendation has become an important research problem. As one of the most representative social media platforms, Twitter provides various real-life information for POI recommendation in real time. Despite that POI recommendation has been actively studied, tweet images have not been well utilized for this research problem. State-of-the-art visual features like convolutional neural network （CNN） features have shown significant performance gains over the traditional bag-of-visual-words in unveiling the image＇s semantics. Unfortunately, they have not been employed for POI recommendation from social websites. Hence, how to make the most of tweet images to improve the performance of POI recommendation and visualization remains open In this paper, we thoroughly study the impact of tweet images on POI recommendation for different POI categories using various visual features. A novel topic model called social media Twitter-latent Dirichlet allocation （SM-TwitterLDA） which jointly models five Twitter features, （i.e., text, image, location, timestamp and hashtag） is designed to discover POIs from the sheer amount of tweets. Moreover, each POI is visualized by representative images selected on three predefined criteria. Extensive experiments have been conducted on a real-life tweet dataset to verify the effectiveness of our method.