Mining outliers in heterogeneous networks is crucial to many applications,but challenges *** this paper,we focus on identifying meta-path-based outliers in heterogeneous information network(HIN),and calculate the simi...
详细信息
Mining outliers in heterogeneous networks is crucial to many applications,but challenges *** this paper,we focus on identifying meta-path-based outliers in heterogeneous information network(HIN),and calculate the similarity between different types of *** propose a meta-path-based outlier detection method(MPOutliers)in heterogeneous information network to deal with problems in one go under a unified *** calculates the heterogeneous reachable probability by combining different types of objects and their *** discovers the semantic information among nodes in heterogeneous networks,instead of only considering the network *** also computes the closeness degree between nodes with the same type,which extends the whole heterogeneous ***,each node is assigned with a reliable weighting to measure its authority *** experiments on two real datasets(AMiner and Movies dataset)show that our proposed method is very effective and efficient for outlier detection.
Most researches on co-authorship network analyze the author's information globally according to the overall network topology structure, instead of analyzing the author's local network. Therefore, this paper pr...
详细信息
Most researches on co-authorship network analyze the author's information globally according to the overall network topology structure, instead of analyzing the author's local network. Therefore, this paper presents a community mining algorithm and divides big co-authorship network into small communities, in which entities' relationship is closer. Then we mine central authors in community by three different centrality standards including closeness centrality, eigenvector centrality and a new proposed measure termed extensity degree centrality. We choose the SIGMOD data as datasets and measure the centrality from different views. And experiments in co-authorship network achieve many interesting results, which indicate our technique is efficient and feasible, and also have reference value for scientific evaluation.
This paper gives a tutorial on how to prove Lyapunov type criteria by optimal control methods. Firstly, we consider stability criteria on Hill’s equations with nonnegative potential. By optimal control methods develo...
详细信息
This paper gives a tutorial on how to prove Lyapunov type criteria by optimal control methods. Firstly, we consider stability criteria on Hill’s equations with nonnegative potential. By optimal control methods developed in 1990s, we obtain several stability criteria including Lyapunov’s criterion, Neǐgauz and Lidskiǐ’s criterion. Secondly, we present stability criteria on Hill’s equations with sign-changing potential in which Brog’s criterion and Krein’s criterion are included.
A text mining algorithm named HMM-TFM (Hidden Markov Model based transcription factor name mining) is presented. The proposed algorithm does not need a dictionary of transcription factor names. A small verb set is def...
详细信息
Policy iteration,which evaluates and improves the control policy iteratively,is a reinforcement learning *** evaluation with the least-squares method can draw more useful information from the empirical data and theref...
详细信息
Policy iteration,which evaluates and improves the control policy iteratively,is a reinforcement learning *** evaluation with the least-squares method can draw more useful information from the empirical data and therefore improve the data ***,most existing online least-squares policy iteration methods only use each sample just once,resulting in the low utilization *** the goal of improving the utilization efficiency,we propose an experience replay for least-squares policy iteration(ERLSPI)and prove its *** method combines online least-squares policy iteration method with experience replay,stores the samples which are generated online,and reuses these samples with least-squares method to update the control *** apply the ERLSPI method for the inverted pendulum system,a typical benchmark *** experimental results show that the method can effectively take advantage of the previous experience and knowledge,improve the empirical utilization efficiency,and accelerate the convergence speed.
A Bloom filter is a space-efficient data structure used for concisely representing a set as well as membership queries at the expense of introducing false positive. In this paper, we propose the L-priorities Bloom fil...
详细信息
A Bloom filter is a space-efficient data structure used for concisely representing a set as well as membership queries at the expense of introducing false positive. In this paper, we propose the L-priorities Bloom filter （LPBF） as a new member of the Bloom filter （BF） family, it uses a limited multidimensional bit space matrix to replace the bit vector of standard bloom filters in order to support different priorities for the elements of a set. We demonstrate the time and space complexity, especially the false positive rate of LPBF. Furthermore, we also present a detailed practical evaluation of the false positive rate achieved by LPBF. The results show that LPBF performs better than standard BFs with respect to false positive rate.
In the fields of social network analysis and knowledge graph, many semi-supervised learning algorithms based on graph convolutional neural network (GCN) have been widely used. Most of these algorithms usually improve ...
详细信息
Currently, the research for the extraction of information in deep web is pretty active. Although many researchers already adopted ontology in the data extraction, many problems still exist. This paper proposed an onto...
详细信息
This paper concerns the existence of affine-periodic solutions for perturbed affine-periodic *** kind of affine-periodic solutions has the form of x(t+T)≡Qx(t) with some nonsingular matrix Q,which may be quasi-period...
详细信息
This paper concerns the existence of affine-periodic solutions for perturbed affine-periodic *** kind of affine-periodic solutions has the form of x(t+T)≡Qx(t) with some nonsingular matrix Q,which may be quasi-periodic when Q is an orthogonal matrix. It can be even unbounded but x(t)/|x(t)| is quasi-periodic,like a helical line. for example x(t)=e^(at)(cos ωt, sin ωt), when Q is not an orthogonal matrix. The averaging method of higher order for finding affine-periodic solutions is given by topological degree.
Community mining has been the focus of many recent researches on dynamic social networks. In this paper, we propose a clustering based improved ant colony algorithm (CIACA) for community mining in social networks. The...
详细信息
暂无评论