Various cyber attacks often occur in logistics network of the Industry 4.0, which poses a threat to Internet security. Intrusion detection can intelligently detect anomalous activities and secure the Internet with the help of anomaly detection algorithms. Different from static data, intrusion detection data are a dynamic data form and have the following characteristics. First, it is multiaspect. Second, it contains point anomalies and group anomalies. Third, there are correlations between different attributes. Nevertheless, these properties pose a challenge on existing anomaly detection approaches. Thus, a novel anomaly detection approach MDS_AD is proposed in this article to deal with the challenges. It combines locality-sensitive hashing (LSH), isolation forest, and PCA techniques. MDS_AD has the following properties. 1) The introduced LSH can operate on multiaspect data. 2) MDS_AD can effectively catch group anomalies from the experimental results. 3) The PCA is utilized to reduce dimensionality for correlations between different attributes. 4) MDS_AD is a streaming approach, which can perform model update and process data in constant memory and time. To confirm the performance of MDS_AD, multiple experiments are designed and implemented on UNSW-NB15 dataset. Experimental results show that MDS_AD outperforms state-of-the-art baselines.

Fast Anomaly Identification Based on Multiaspect Data Streams for Intelligent Intrusion Detection Toward Secure Industry 4.0

Using Web APIs registered in service sharing communities for mobile APP development can not only reduce development period and cost, but also fully reuse state-of-the-art research outcomes in broad domain so as to ensure up-to-date APP development and applications. However, the big volume of available APIs in Web communities as well as their differences make it difficult for APIs selection considering compatibility, preferred partial APIs and expected APIs functions which are often of high variety. Accordingly, how to recommend a set of functional-satisfactory and compatibility-optimal APIs based on the APP developer's multiple function expectation and pre-chosen partial APIs is on demand as a significant challenge for successful APP development. To address this challenge, we first construct a Web APIs correlation graph that incorporates functional descriptions and compatibility information of Web APIs, and then propose a correlation graph-based approach for personalized and compatible Web APIs recommendation in mobile APP development. Finally, through extensive experiments on a real dataset crawled from Web APIs websites, we prove the feasibility of our proposed recommendation approach. 

A Correlation Graph based Approach for Personalized and Compatible Web APIs Recommendation in Mobile APP Development

Using Web APIs registered in service sharing communities for mobile APP development can not only reduce development period and cost, but also fully reuse state-of-the-art research outcomes in broad domain so as to ensure up-to-date APP development and applications. However, the big volume of available APIs in Web communities as well as their differences make it difficult for APIs selection considering compatibility, preferred partial APIs and expected APIs functions which are often of high variety. Accordingly, how to recommend a set of functional-satisfactory and compatibility-optimal APIs based on the APP developer's multiple function expectation and pre-chosen partial APIs is on demand as a significant challenge for successful APP development. To address this challenge, we first construct a Web APIs correlation graph that incorporates functional descriptions and compatibility information of Web APIs, and then propose a correlation graph-based approach for personalized and compatible Web APIs recommendation in mobile APP development. Finally, through extensive experiments on a real dataset crawled from Web APIs websites, we prove the feasibility of our proposed recommendation approach.

A Correlation Graph Based Approach for Personalized and Compatible Web APIs Recommendation in Mobile APP Development

The main goal of this research paper is to apply a deep neural network model for time series forecasting of environmental variables. Accurate forecasting of snow cover and NDVI are important issues for the reliable and efficient hydrological models and prediction of the spread of forest. Long Short Term Memory (LSTM) model for the time series forecasting of snow cover, temperature, and normalized difference vegetation index (NDVI) are studied in this research work. Artificial neural networks (ANN) are widely used for forecasting time series due to their adaptive computing nature. LSTM and Recurrent neural networks (RNN) are some of the several architectures provided in a class of ANN. LSTM is a kind of RNN that has the capability of learning long-term dependencies. We followed a coarse-to-fine strategy, providing reviews of various related research materials and supporting it with the LSTM analysis on the dataset of Himachal Pradesh, as gathered. Environmental factors of the Himachal Pradesh region are forecasted using the dataset, consisting of temperature, snow cover, and vegetation index as parameters from the year 2001-2017. Currently, available tools and techniques make the presented system more efficient to quickly assess, adjust, and improve the environment-related factors analysis. 

/pdf/analysis-of-environmental-factors-using-ai-and-ml-methods-jlrupv9r.pdf

Analysis of environmental factors using AI and ML methods

Most sentiment analysis models that use supervised learning algorithms consume a lot of labeled data in the training phase in order to give satisfactory results. This is usually expensive and leads to high labor costs in real-world applications. This work consists in proposing a hybrid sentiment analysis model based on a Long Short-Term Memory network, a rule-based sentiment analysis lexicon and the Term Frequency-Inverse Document Frequency weighting method. These three (input) models are combined in a binary classification model. In the latter, each of these algorithms has been implemented: Logistic Regression, k-Nearest Neighbors, Random Forest, Support Vector Machine and Naive Bayes. Then, the model has been trained on a limited amount of data from the IMDB dataset. The results of the evaluation on the IMDB data show a significant improvement in the Accuracy and F1 score compared to the best scores recorded by the three input models separately. On the other hand, the proposed model was able to transfer the knowledge gained on the IMDB dataset to better handle a new data from Twitter US Airlines Sentiments dataset.

/pdf/lstm-vader-and-tf-idf-based-hybrid-sentiment-analysis-model-4d2xcizcjb.pdf

LSTM, VADER and TF-IDF based Hybrid Sentiment Analysis Model

A growing number of web APIs published on the Internet allows mashup developers to discover appropriate web APIs for polishing mashups. Developers often have to manually pick and choose several web APIs from extremely massive candidates, which is a laborious and cumbersome task. Fortunately, recommender system comes into existence. Some approaches perform recommendations in cloud platforms by utilizing historical records of Mashup-API interactions stored in edge nodes. However, many of these methods often pay more attention to recommendation accuracy while ignoring recommendation diversity, i.e., there are usually popular web APIs in recommendation list while most of the other novel web APIs are absent. The poor recommendation diversity may limit the usefulness of the recommendation results due to the lack of novelty. In order to implement an accurate and diversified web API recommendation, a novel MF-based recommendation approach named Div_PreAPI is put forward in this paper. Div_PreAPI integrates a weighting mechanism and neighborhood information into matrix factorization (MF) to implement diversified and personalized APIs recommendations. Finally, we conduct a series of experiments on a real-world dataset. Experimental results show the effectiveness of our proposal.

Edge-cloud-enabled matrix factorization for diversified APIs recommendation in mashup creation

With the ever‐increasing popularity of web application programming interfaces (APIs) sharing communities, it is becoming a promising way for software developers to design and create their interesting Apps through composing a set of selected web APIs that can collectively fulfill the App functions expected by the App developer. However, the App developer's web APIs selection decision‐makings are often nontrivial due to the massive candidate APIs as well as their diverse functions. Furthermore, it is difficult to guarantee that the selected web APIs are compatible enough. Moreover, traditional web APIs recommendation approaches only return a recommended APIs list, which are often not sufficient to accommodate the App developer's undetermined and fuzzy personalized preferences. Considering the above challenges, a novel keywords‐driven web APIs recommendation approach called keywords‐driven and compatibility‐aware multiple API group recommendation is proposed in this article for green and compatible software, which cannot only satisfy the App developer's functional requirements, but also return a group of web APIs recommended lists. Each returned list includes a set of compatible web APIs. Finally, we design a series of experiments based on a real‐world web APIs dataset, that is, PW dataset crawled from www.programmableWeb.com. Experimental reports compared with other competitive approaches in existing literatures indicate the effectiveness and efficiency of our proposal in this work.

Keywords-driven web APIs group recommendation for automatic app service creation process

With the development of mobile Internet, more and more individuals and institutions tend to express their views on certain things (such as software and music) on social platforms. In some online social network services, users are allowed to label users with similar interests as “trust” to get the information they want and use “distrust” to label users with opposite interests to avoid browsing content they do not want to see. The networks containing such trust relationships and distrust relationships are named signed social networks (SSNs), and some real-world complex systems can be also modeled with signed networks. However, the sparse social relationships seriously hinder the expansion of users’ social circle in social networks. In order to solve this problem, researchers have done a lot of research on link prediction. Although these studies have been proved to be effective in the unsigned social network, the prediction of trust and distrust in SSN has not achieved good results. In addition, the existing link prediction research does not consider the needs of user privacy protection, so most of them do not add privacy protection measures. To solve these problems, we propose a trust-based missing link prediction method (TMLP). First, we use the simhash method to create a hash index for each user. Then, we calculate the Hamming distance between the two users to determine whether they can establish a new social relationship. Finally, we use the fuzzy computing model to determine the type of their new social relationship (e.g., trust or distrust). In the paper, we gradually explain our method through a case study and prove our method’s feasibility.

/pdf/trust-based-missing-link-prediction-in-signed-social-4tl3i4uzy2.pdf

Trust-Based Missing Link Prediction in Signed Social Networks with Privacy Preservation

In recent years, the number of web services grows explosively. With a large amount of information resources, it is difficult for users to quickly find the services they need. Thus, the design of an effective web service recommendation method has become the key factor to satisfy the requirements of users. However, traditional recommendation methods often tend to pay more attention to the accuracy of the results but ignore the diversity, which may lead to redundancy and overfitting, thus reducing the satisfaction of users. Considering these drawbacks, a novel method called DivMTID is proposed to improve the effectiveness by achieving accurate and diversified recommendations. First, we utilize users’ historical scores of web services to explore the users’ preferences. And we use the TF-IDF algorithm to calculate the weight vector of each web service. Second, we utilize cosine similarity to calculate the similarity between candidate web services and historical web services and we also forecast the ranking scores of candidate web services. At last, a diversification method is used to generate the top- recommended list for users. And through a case study, we show that DivMTID is an effective, accurate, and diversified web service recommendation method.

/pdf/service-recommendation-with-high-accuracy-and-diversity-2l038zexjd.pdf

Service Recommendation with High Accuracy and Diversity

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

Chao Lv

Author Tools

Chat about Author

Papers

Edge-cloud-enabled matrix factorization for diversified APIs recommendation in mashup creation

Keywords-driven web APIs group recommendation for automatic app service creation process

Trust-Based Missing Link Prediction in Signed Social Networks with Privacy Preservation

Service Recommendation with High Accuracy and Diversity