User Churn Prediction Hierarchical Model Based on Graph Attention Convolutional Neural Networks

The telecommunications industry is becoming increasingly aware of potential subscriber churn as a result of the growing popularity of smartphones in the mobile Internet era,the quick development of telecommunications services,the implementation of the number portability policy,and the intensifying competition among operators.At the same time,users'consumption preferences and choices are evolving.Excellent churn prediction models must be created in order to accurately predict the churn tendency,since keeping existing customers is far less expensive than acquiring new ones.But conventional or learning-based algorithms can only go so far into a single subscriber's data;they cannot take into consideration changes in a subscriber's subscription and ignore the coupling and correlation between various features.Additionally,the current churn prediction models have a high computational burden,a fuzzy weight distribution,and significant resource economic costs.The prediction algorithms involving network models currently in use primarily take into account the private information shared between users with text and pictures,ignoring the reference value supplied by other users with the same package.This work suggests a user churn prediction model based on Graph Attention Convolutional Neural Network(GAT-CNN)to address the aforementioned issues.The main contributions of this paper are as follows:Firstly,we present a three-tiered hierarchical cloud-edge cooperative framework that increases the volume of user feature input by means of two aggregations at the device,edge,and cloud layers.Second,we extend the use of users'own data by introducing self-attention and graph convolution models to track the relative changes of both users and packages simultaneously.Lastly,we build an integrated offline-online system for churn prediction based on the strengths of the two models,and we experimentally validate the efficacy of cloudside collaborative training and inference.In summary,the churn prediction model based on Graph Attention Convolutional Neural Network presented in this paper can effectively address the drawbacks of conventional algorithms and offer telecom operators crucial decision support in developing subscriber retention strategies and cutting operational expenses.

Weighted Forwarding in Graph Convolution Networks for Recommendation Information Systems

Recommendation Information Systems(RIS)are pivotal in helping users in swiftly locating desired content from the vast amount of information available on the Internet.Graph Convolution Network(GCN)algorithms have been employed to implement the RIS efficiently.However,the GCN algorithm faces limitations in terms of performance enhancement owing to the due to the embedding value-vanishing problem that occurs during the learning process.To address this issue,we propose a Weighted Forwarding method using the GCN(WF-GCN)algorithm.The proposed method involves multiplying the embedding results with different weights for each hop layer during graph learning.By applying the WF-GCN algorithm,which adjusts weights for each hop layer before forwarding to the next,nodes with many neighbors achieve higher embedding values.This approach facilitates the learning of more hop layers within the GCN framework.The efficacy of the WF-GCN was demonstrated through its application to various datasets.In the MovieLens dataset,the implementation of WF-GCN in LightGCN resulted in significant performance improvements,with recall and NDCG increasing by up to+163.64%and+132.04%,respectively.Similarly,in the Last.FM dataset,LightGCN using WF-GCN enhanced with WF-GCN showed substantial improvements,with the recall and NDCG metrics rising by up to+174.40%and+169.95%,respectively.Furthermore,the application of WF-GCN to Self-supervised Graph Learning(SGL)and Simple Graph Contrastive Learning(SimGCL)also demonstrated notable enhancements in both recall and NDCG across these datasets.

TG-SMR:AText Summarization Algorithm Based on Topic and Graph Models

Recently,automation is considered vital in most fields since computing methods have a significant role in facilitating work such as automatic text summarization.However,most of the computing methods that are used in real systems are based on graph models,which are characterized by their simplicity and stability.Thus,this paper proposes an improved extractive text summarization algorithm based on both topic and graph models.The methodology of this work consists of two stages.First,the well-known TextRank algorithm is analyzed and its shortcomings are investigated.Then,an improved method is proposed with a new computational model of sentence weights.The experimental results were carried out on standard DUC2004 and DUC2006 datasets and compared to four text summarization methods.Finally,through experiments on the DUC2004 and DUC2006 datasets,our proposed improved graph model algorithm TG-SMR(Topic Graph-Summarizer)is compared to other text summarization systems.The experimental results prove that the proposed TG-SMR algorithm achieves higher ROUGE scores.It is foreseen that the TG-SMR algorithm will open a new horizon that concerns the performance of ROUGE evaluation indicators.

Graph-Based Chinese Word Sense Disambiguation with Multi-Knowledge Integration

Word sense disambiguation(WSD)is a fundamental but significant task in natural language processing,which directly affects the performance of upper applications.However,WSD is very challenging due to the problem of knowledge bottleneck,i.e.,it is hard to acquire abundant disambiguation knowledge,especially in Chinese.To solve this problem,this paper proposes a graph-based Chinese WSD method with multi-knowledge integration.Particularly,a graph model combining various Chinese and English knowledge resources by word sense mapping is designed.Firstly,the content words in a Chinese ambiguous sentence are extracted and mapped to English words with BabelNet.Then,English word similarity is computed based on English word embeddings and knowledge base.Chinese word similarity is evaluated with Chinese word embedding and HowNet,respectively.The weights of the three kinds of word similarity are optimized with simulated annealing algorithm so as to obtain their overall similarities,which are utilized to construct a disambiguation graph.The graph scoring algorithm evaluates the importance of each word sense node and judge the right senses of the ambiguous words.Extensive experimental results on SemEval dataset show that our proposed WSD method significantly outperforms the baselines.

The Refinement Algorithm Consideration in Text Clustering Scheme Based on Multilevel Graph

To construct a high efficient text clustering algorithm the multilevel graph model and the refinement algorithm used in the uncoarsening phase is discussed. The model is applied to text clustering. The performance of clustering algorithm has to be improved with the refinement algorithm application. The experiment result demonstrated that the multilevel graph text clustering algorithm is available. Key words text clustering - multilevel coarsen graph model - refinement algorithm - high-dimensional clustering CLC number TP301 Foundation item: Supported by the National Natural Science Foundation of China (60173051)Biography: CHEN Jian-bin(1970-), male, Associate professor, Ph. D., research direction: data mining.

Document Clustering Using Graph Based Fuzzy Association Rule Generation

With the wider growth of web-based documents,the necessity of automatic document clustering and text summarization is increased.Here,document summarization that is extracting the essential task with appropriate information,removal of unnecessary data and providing the data in a cohesive and coherent manner is determined to be a most confronting task.In this research,a novel intelligent model for document clustering is designed with graph model and Fuzzy based association rule generation(gFAR).Initially,the graph model is used to map the relationship among the data(multi-source)followed by the establishment of document clustering with the generation of association rule using the fuzzy concept.This method shows benefit in redundancy elimination by mapping the relevant document using graph model and reduces the time consumption and improves the accuracy using the association rule generation with fuzzy.This framework is provided in an interpretable way for document clustering.It iteratively reduces the error rate during relationship mapping among the data(clusters)with the assistance of weighted document content.Also,this model represents the significance of data features with class discrimination.It is also helpful in measuring the significance of the features during the data clustering process.The simulation is done with MATLAB 2016b environment and evaluated with the empirical standards like Relative Risk Patterns(RRP),ROUGE score,and Discrimination Information Measure(DMI)respectively.Here,DailyMail and DUC 2004 dataset is used to extract the empirical results.The proposed gFAR model gives better trade-off while compared with various prevailing approaches.

STPGTN-AMulti-Branch Parameters Identification Method Considering Spatial Constraints and Transient Measurement Data

Transmission line(TL)Parameter Identification(PI)method plays an essential role in the transmission system.The existing PI methods usually have two limitations:(1)These methods only model for single TL,and can not consider the topology connection of multiple branches for simultaneous identification.(2)Transient bad data is ignored by methods,and the random selection of terminal section data may cause the distortion of PI and have serious consequences.Therefore,a multi-task PI model considering multiple TLs’spatial constraints and massive electrical section data is proposed in this paper.The Graph Attention Network module is used to draw a single TL into a node and calculate its influence coefficient in the transmission network.Multi-Task strategy of Hard Parameter Sharing is used to identify the conductance ofmultiple branches simultaneously.Experiments show that themethod has good accuracy and robustness.Due to the consideration of spatial constraints,the method can also obtain more accurate conductance values under different training and testing conditions.

Entity generation algorithm based on reference expansion

The extraction and understanding of text knowledge become increasingly crucial in the age of big data.One of the current research areas in the field of natural language processing(NLP)is how to accurately understand the text and collect accurate linguistic information because Chinese vocabulary is diverse and ambiguous.This paper mainly studies the candidate entity generation module of the entity link system.The candidate entity generation module constructs an entity reference expansion algorithm to improve the recall rate of candidate entities.In order to improve the efficiency of the connection algorithm of the entire system while ensuring the recall rate of candidate entities,we design a graph model filtering algorithm that fuses shallow semantic information to filter the list of candidate entities,and verify and analyze the efficiency of the algorithm through experiments.By analyzing the related technology of the entity linking algorithm,we study the related technology of candidate entity generation and entity disambiguation,improve the traditional entity linking algorithm,and give an innovative and practical entity linking model.The recall rate exceeds 82%,and the link accuracy rate exceeds 73%.Efficient and accurate entity linking can help machines to better understand text semantics,further promoting the development of NLP and improving the users’knowledge acquisition experience on the text.

Local Trade Networks among Farmers and Traders

Both farmers and traders benefit from trade networking, which is crucial for the local economy. Therefore, it is crucial to understand how these networks operate, and how they can be managed more effectively. Throughout this study, we examine the economic networks formed between farmers and traders through the trade of food products. These networks are analyzed from the perspective of their structure and the factors that influence their development. Using data from 18 farmers and 15 traders, we applied exponential random graph models. The results of our study showed that connectivity, Popularity Spread, activity spread, good transportation systems, and high yields all affected the development of networks. Therefore, farmers’ productivity and high market demand can contribute to local food-crop trade. The network was not affected by reciprocity, open markets, proximity to locations, or trade experience of actors. Policy makers should consider these five factors when formulating policies for local food-crop trade. Additionally, local actors should be encouraged to use these factors to improve their network development. However, it is important to note that these factors alone cannot guarantee success. Policy makers and actors must also consider other factors such as legal frameworks, economic policies, and resource availability. Our approach can be used in future research to determine how traders and farmers can enhance productivity and profit in West Africa. This study addresses a research gap by examining factors influencing local food trade in a developing country.

Multi-satellite observation integrated scheduling method oriented to emergency tasks and common tasks

Satellite observation scheduling plays a significant role in improving the efficiency of satellite observation systems.Although many scheduling algorithms have been proposed,emergency tasks,characterized as importance and urgency（e.g.,observation tasks orienting to the earthquake area and military conflict area）,have not been taken into account yet.Therefore,it is crucial to investigate the satellite integrated scheduling methods,which focus on meeting the requirements of emergency tasks while maximizing the profit of common tasks.Firstly,a pretreatment approach is proposed,which eliminates conflicts among emergency tasks and allocates all tasks with a potential time-window to related orbits of satellites.Secondly,a mathematical model and an acyclic directed graph model are constructed.Thirdly,a hybrid ant colony optimization method mixed with iteration local search（ACO-ILS） is established to solve the problem.Moreover,to guarantee all solutions satisfying the emergency task requirement constraints,a constraint repair method is presented.Extensive experimental simulations show that the proposed integrated scheduling method is superior to two-phased scheduling methods,the performance of ACO-ILS is greatly improved in both evolution speed and solution quality by iteration local search,and ACO-ILS outperforms both genetic algorithm and simulated annealing algorithm.

Attitude Analysis in Process Conflict for C919 Aircraft Manufacturing

Based on the option prioritization in graph model for conflict resolution of two decision makers(DMs),new logical and matrix representations of four stability concepts for DMs′attitude are proposed.The logical representation of attitude is defined,and converted to the matrix form in order to develop a decision support system(DSS)efficiently.Compared with existing definitions of DMs′attitude based on states,the proposed definitions of attitude based on options are convenient and more effective to generate preferences since that of states can be significantly larger than that of options in a large conflict.In addition,it is easier to obtain the information of the prioritization of option statements than to obtain preference of states for users.The proposed representations are applied to the process conflict during aircraft manufacturing to demonstrate the efficiency of the new approach.

Dynamic airspace sectorization via improved genetic algorithm

This paper deals with dynamic airspace sectorization （DAS） problem by an improved genetic algorithm （iGA）. A graph model is first constructed that represents the airspace static structure. Then the DAS problem is formulated as a graph-partitioning problem to balance the sector workload under the premise of ensuring safety. In the iGA, multiple populations and hybrid coding are applied to determine the optimal sector number and airspace sectorization. The sector constraints are well satisfied by the improved genetic operators and protect zones. This method is validated by being applied to the airspace of North China in terms of three indexes, which are sector balancing index, coordination workload index and sector average flight time index. The improvement is obvious, as the sector balancing index is reduced by 16.5 %, the coordination workload index is reduced by 11.2 %, and the sector average flight time index is increased by 11.4 % during the peak-hour traffic.

A Novel Unsupervised Change Detection Method with Structure Consistency and GFLICM Based on UAV Images

With the rapid development of Unmanned Aerial Vehicle(UAV)technology,change detection methods based on UAV images have been extensively studied.However,the imaging of UAV sensors is susceptible to environmental interference,which leads to great differences of same object between UAV images.Overcoming the discrepancy difference between UAV images is crucial to improving the accuracy of change detection.To address this issue,a novel unsupervised change detection method based on structural consistency and the Generalized Fuzzy Local Information C-means Clustering Model(GFLICM)was proposed in this study.Within this method,the establishment of a graph-based structural consistency measure allowed for the detection of change information by comparing structure similarity between UAV images.The local variation coefficient was introduced and a new fuzzy factor was reconstructed,after which the GFLICM algorithm was used to analyze difference images.Finally,change detection results were analyzed qualitatively and quantitatively.To measure the feasibility and robustness of the proposed method,experiments were conducted using two data sets from the cities of Yangzhou and Nanjing.The experimental results show that the proposed method can improve the overall accuracy of change detection and reduce the false alarm rate when compared with other state-of-the-art change detection methods.

Structural Indexing for 3D Solid Digital Library

In a very large digital library that support computer aided collaborative design, an indexing process is crucial whenever the retrieval process has to select among many possible designs. In this paper, we address the problem of retrieving important design and engineering information by structural indexing. A design is represented by a model dependency graph, therefor, the indexing problem is to determine whether a graph is present or absent in a database of model dependency graphs. we present a novel graph indexing method using polynomial characterization of a model dependency graph and on hashing. Such an approach is able to create an high efficient 3D solid digital library for retrieving and extracting solid geometric model and engineering information.

Modified Shifting Bottleneck Heuristic for Scheduling Problems of Large-Scale Job Shops

A modified shifting bottleneck algorithm was proposed to solve scheduling problems of a large-scale job shop.Firstly,a new structured algorithm was employed for sub-problems so as to reduce the computational burden and suit for large-scale instances more effectively.The modified cycle avoidance method,incorporating with the disjunctive graph model and topological sort algorithm,was applied to guaranteeing the feasibility of solutions with considering delayed precedence constraints.Finally,simulation experiments were carried out to verify the feasibility and effectiveness of the modified method.The results demonstrate that the proposed algorithm can solve the large-scale job shop scheduling problems(JSSPs) within a reasonable period of time and obtaining satisfactory solutions simultaneously.

Topological Expression Model of Satellite Gear Mechanism

By investigation of the topological characteristics of the kinematic structure of Satellite Gear Mechanism (SGM) with graph theory, the graph model of SGM is analyzed, and a topological expression model between input and output of SGM is established based on systematic design point. Meanwhile, the mathematical expression for SGM is deduced by integrating matrix theory and graph theory; thus, the topological characteristics of the kinematic structure of SGM can be converted into a matrix model, and the topological design problem of SGM into a matrix operation problem. In addition, a brief discussion about the measures for identification of isomorphism of the graph mode is made.

Clustering spatio-temporal bi-partite graphs for finding crowdsourcing communities in IoMT networks

The Internet of Moving Things is rapidly becoming a reality where intelligent devices and infrastructures are fostering real-time data sus-tainability in smart cities and advancing crowdsourced tasks to improve energy consumption,waste management,and traffic operations.These intelligent devices create a complex network scenario in which they often move together or in conjunction with one another to complete crowdsourced tasks.Our research premise is that mobility relationships matter when performing these tasks,and therefore,a graph model based on representing the changes in mobility relation-ships is needed to help identify the neighbour devices that are moving close to one another in our physical world but also seamlessly con-nected in their virtual world.We propose a bi-partite community mobility graph model for linking intelligent devices in both virtual and physical worlds,as well as reaching a trade-off between crowd-sourced tasks designed with explicit and implicit citizen participation.This paper aims to explore a bi-partite graph as a promising spatiotemporal representation of IoMT networks since changes in mobility relationships over time can indicate volunteer organisation at the device and community levels.The Louvain community detection method is proposed to find communities of intelligent devices to reveal a value conscious participation of citizens.The proposed bi-partite graph model is evaluated using a real-world scenario in transportation,confirming the main role of evolving communities in developing crowdsourcing IoMT networks.

COMPARISON OF THE ANALYTIC NETWORK PROCESS AND THE GRAPH MODEL FOR CONFLICT RESOLUTION

A comparison of two decision analysis tools for the analysis of strategic conflicts, the Analytic Network Process （ANP） and the graph model for conflict resolution, is carried out by applying them to the China-US TV dumping conflict. Firstly, the graph model is introduced along with practical procedures for modeling and analyzing conflicts using the decision support software, GMCR Ⅱ. Next, ANP is explained, emphasizing structural features and procedures for synthesizing priorities. Then a framework for employing ANP to analyze strategic conflicts is designed and used to compare ANP to the graph model. The case study of the China-US TV dumping conflict provides a basis for the graph model and ANP to be compared; different features of the approaches are highlighted. The study shows that because of different theoretical backgrounds, ANP and the graph model for conflict analysis both provide useful information which can be combined to furnish a better understanding of a strategic conflict.

DOMINATING ATTITUDES IN THE GRAPH MODEL FOR CONFLICT RESOLUTION

A formal methodology for analyzing the importance of weighing a decision maker＇s attitudes in a conflict is introduced and applied to the problem of negotiating a fair transfer of a brownfield property. A decision maker＇s attitudes are expressed in his consideration of his own preferences, as well as those of his opponents. Dominating attitudes are used to suggest that in a circumstance in which a decision maker takes into account multiple perspectives due to his attitudes, he may favor one perspective more heavily. The analysis of a brownfield acquisition conflict illustrates the types of insights that this methodology reveals.

ANALYZING MARKET COMPETITION BETWEEN AIRBUS AND BOEING USING A DUO HIERARCHICAL GRAPH MODEL FOR CONFLICT RESOLUTION

A duo hierarchical graph model for conflict resolution is developed to investigate market competition between Airbus and Boeing over aircraft sales in the Asia Pacific region. The duo hierarchical graph model, a significant extension of the graph model for conflict resolution methodology, contains two common decision makers, who take part in two related subconflicts, as well as local decision makers, who participate in only one subconflict. New stability definitions are proposed to describe forms of sanction unique to the hierarchical model. The interrelationships between stabilities in the overall graph model and in the two local models are investigated. Then the duo hierarchical graph model is applied to the competition between Airbus and Boeing in both the wide and narrow body markets in the Asia-Pacific region. The two types of Asian airlines have different operating strategies, so that the two markets constitute sub-competitions that can be modelled naturally using the duo hierarchical graph model. The stability results indicate a resolution for all decision makers that implies marketing strategies for the aircraft manufacturers and guidelines for aircraft purchase by the airlines. Thus, this model provides decision makers with a comprehensive understanding of the dynamics of the comoetition and guidance in identifving beneficial actions.