BotSpot++: A Hierarchical Deep Ensemble Model for Bots Install Fraud Detection in Mobile Advertising

Mobile advertising has undoubtedly become one of the fastest-growing industries in the world. The influx of capital attracts increasing fraudsters to defraud money from advertisers. Fraudsters can leverage many techniques, where bots install fraud is the most difficult to detect due to its ability to emulate normal users by implementing sophisticated behavioral patterns to evade from detection rules defined by human experts. Therefore, we proposed BotSpot 1 for bots install fraud detection previously. However, there are some drawbacks in BotSpot, such as the sparsity of the devices’ neighbors, weak interactive information of leaf nodes, and noisy labels. In this work, we propose BotSpot++ to improve these drawbacks: (1) for the sparsity of the devices’ neighbors, we propose to construct a super device node to enrich the graph structure and information flow utilizing domain knowledge and a clustering algorithm; (2) for the weak interactive information, we propose to incorporate a self-attention mechanism to enhance the interaction of various leaf nodes; and (3) for the noisy labels, we apply a label smoothing mechanism to alleviate it. Comprehensive experimental results show that BotSpot++ yields the best performance compared with six state-of-the-art baselines. Furthermore, we deploy our model to the advertising platform of Mobvista, 2 a leading global mobile advertising company. The online experiments also demonstrate the effectiveness of our proposed method.

A Coarse-to-Fine Registration Approach for Point Cloud Data with Bipartite Graph Structure

Alignment is a critical aspect of point cloud data (PCD) processing, and we propose a coarse-to-fine registration method based on bipartite graph matching in this paper. After data pre-processing, the registration progress can be detailed as follows: Firstly, a top-tail (TT) strategy is designed to normalize and estimate the scale factor of two given PCD sets, which can combine with the coarse alignment process flexibly. Secondly, we utilize the 3D scale-invariant feature transform (3D SIFT) method to extract point features and adopt fast point feature histograms (FPFH) to describe corresponding feature points simultaneously. Thirdly, we construct a similarity weight matrix of the source and target point data sets with bipartite graph structure. Moreover, the similarity weight threshold is used to reject some bipartite graph matching error-point pairs, which determines the dependencies of two data sets and completes the coarse alignment process. Finally, we introduce the trimmed iterative closest point (TrICP) algorithm to perform fine registration. A series of extensive experiments have been conducted to validate that, compared with other algorithms based on ICP and several representative coarse-to-fine alignment methods, the registration accuracy and efficiency of our method are more stable and robust in various scenes and are especially more applicable with scale factors.

A Plant Disease Recognition Method Based on Fusion of Images and Graph Structure Text

The disease image recognition models based on deep learning have achieved relative success under limited and restricted conditions, but such models are generally subjected to the shortcoming of weak robustness. The model accuracy would decrease obviously when recognizing disease images with complex backgrounds under field conditions. Moreover, most of the models based on deep learning only involve characterization learning on visual information in the image form, while the expression of other modal information rather than the image form is often ignored. The present study targeted the main invasive diseases in tomato and cucumber as the research object. Firstly, in response to the problem of weak robustness, a feature decomposition and recombination method was proposed to allow the model to learn image features at different granularities so as to accurately recognize different test images. Secondly, by extracting the disease feature words from the disease text description information composed of continuous vectors and recombining them into the disease graph structure text, the graph convolutional neural network (GCN) was then applied for feature learning. Finally, a vegetable disease recognition model based on the fusion of images and graph structure text was constructed. The results show that the recognition accuracy, precision, sensitivity, and specificity of the proposed model were 97.62, 92.81, 98.54, and 93.57%, respectively. This study improved the model robustness to a certain extent, and provides ideas and references for the research on the fusion method of image information and graph structure information in disease recognition.

The Impact of Global Structural Information in Graph Neural Networks Applications

Graph Neural Networks (GNNs) rely on the graph structure to define an aggregation strategy where each node updates its representation by combining information from its neighbours. A known limitation of GNNs is that, as the number of layers increases, information gets smoothed and squashed and node embeddings become indistinguishable, negatively affecting performance. Therefore, practical GNN models employ few layers and only leverage the graph structure in terms of limited, small neighbourhoods around each node. Inevitably, practical GNNs do not capture information depending on the global structure of the graph. While there have been several works studying the limitations and expressivity of GNNs, the question of whether practical applications on graph structured data require global structural knowledge or not remains unanswered. In this work, we empirically address this question by giving access to global information to several GNN models, and observing the impact it has on downstream performance. Our results show that global information can in fact provide significant benefits for common graph-related tasks. We further identify a novel regularization strategy that leads to an average accuracy improvement of more than 5% on all considered tasks.

Employing Graph Theory on Social Networks by Data Encryption to Enhance Privacy

Now a day’s users of Online Social Network have been increased by the Internet usage. As huge number of online social Network users, it becomes more and more interactive and privacy becomes a matter of increasing concern. To solve this problem, graph structure, Proposed Algorithm, Encryption Algorithm used, which excludes the users which combine the information of the status of privacy users. By using these methods, the experiment can be done which helps to show how the server works in between the sender and receiver and to receive their information without knowing third parties. And it would be easier by using graph that shows it can be efficiently helps the users to improve their privacy disclosure. Keywords: Graph theory, social network, Privacy, Data Encryption, end to end encryption, Encryption Algorithm.

On Analysis of Banhatti Indices for Hyaluronic Acid Curcumin and Hydroxychloroquine

Topological indices are numerical numbers assigned to the graph/structure and are useful to predict certain physical/chemical properties. In this paper, we give explicit expressions of novel Banhatti indices, namely, first K Banhatti index B 1 G , second K Banhatti index B 2 G , first K hyper-Banhatti index HB 1 G , second K hyper-Banhatti index HB 2 G , and K Banhatti harmonic index H b G for hyaluronic acid curcumin and hydroxychloroquine. The multiplicative version of these indices is also computed for these structures.

Structure of intersection graphs

<p style="text-align: left;" dir="ltr"> Let <em>G</em> be a finite group and let <em>N</em> be a fixed normal subgroup of <em>G</em>. In this paper, a new kind of graph on <em>G</em>, namely the intersection graph is defined and studied. We use <img src="/public/site/images/ikhsan/equation.png" alt="" width="6" height="4" /> to denote this graph, with its vertices are all normal subgroups of <em>G</em> and two distinct vertices are adjacent if their intersection in <em>N</em>. We show some properties of this graph. For instance, the intersection graph is a simple connected with diameter at most two. Furthermore we give the graph structure of <img src="/public/site/images/ikhsan/equation_(1).png" alt="" width="6" height="4" /> for some finite groups such as the symmetric, dihedral, special linear group, quaternion and cyclic groups. </p>

Completing WordNets with Sememe Knowledge

WordNets organize words into synonymous word sets, and the connections between words present the semantic relationships between them, which have become an indispensable source for natural language processing (NLP) tasks. With the development and evolution of languages, WordNets need to be constantly updated manually. To address the problem of inadequate word semantic knowledge of “new words”, this study explores a novel method to automatically update the WordNet knowledge base by incorporating word-embedding techniques with sememe knowledge from HowNet. The model first characterizes the relationships among words and sememes with a graph structure and jointly learns the embedding vectors of words and sememes; finally, it synthesizes word similarities to predict concepts (synonym sets) of new words. To examine the performance of the proposed model, a new dataset connected to sememe knowledge and WordNet is constructed. Experimental results show that the proposed model outperforms the existing baseline models.