CN109657160A - Method and system for estimating incoming degree information based on random walk access frequency number - Google Patents

Method and system for estimating incoming degree information based on random walk access frequency number Download PDF

Info

Publication number
CN109657160A
CN109657160A CN201811632238.0A CN201811632238A CN109657160A CN 109657160 A CN109657160 A CN 109657160A CN 201811632238 A CN201811632238 A CN 201811632238A CN 109657160 A CN109657160 A CN 109657160A
Authority
CN
China
Prior art keywords
node
network
random walk
degree
visited
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201811632238.0A
Other languages
Chinese (zh)
Other versions
CN109657160B (en
Inventor
吕欣
陈洒然
刘忠
谭跃进
秦烁
蔡梦思
黄格
肖时耀
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
National University of Defense Technology
Original Assignee
National University of Defense Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by National University of Defense Technology filed Critical National University of Defense Technology
Priority to CN201811632238.0A priority Critical patent/CN109657160B/en
Publication of CN109657160A publication Critical patent/CN109657160A/en
Application granted granted Critical
Publication of CN109657160B publication Critical patent/CN109657160B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/01—Social networking

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Primary Health Care (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • General Health & Medical Sciences (AREA)
  • Human Resources & Organizations (AREA)
  • Marketing (AREA)
  • Computing Systems (AREA)
  • Health & Medical Sciences (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention discloses an incoming degree information estimation method based on random walk access frequency, which comprises the following steps of 1: randomly selecting a seed node which is randomly walked from a directed network of the information of the degree of admission to be estimated, wherein the seed node is any node of the network, then implementing random walk, and randomly selecting a subsequent node which is randomly walked from a neighbor node of the current node; step 2: in the random walk process, the number x of times each node i is repeatedly visited is recordedi(ii) a And step 3: when the number N of walking steps is equal to the number N of nodes of the network, counting the number x of times each node i is visitedi(ii) a And 4, step 4: estimating and outputting the in-degree information according to the counted number of times that each node i is visited; when the method is used for solving the problem of nondirectional weakness in the directed network, the degree of entry information is estimated by counting the number of times each node is visited in the random walk process, the error of the estimated degree of entry information is small, and the estimation efficiency is high.

Description

Method and system for estimating incoming degree information based on random walk access frequency number
Technical Field
The invention belongs to the field of social network topology information estimation, and particularly relates to an incoming degree information estimation method and system based on random walk access frequency.
Background
The current online social network is huge in scale, and provides a platform for researching complex networks, real group characteristics and behaviors for researchers. And because of their large size, researchers are unable to perform full network information gathering or acquisition for analysis. Generally, partial information of the network can be acquired only by means of random walk. The recovery of the topological structure of the network by using the acquired network part information is the basis for subsequent complex network analysis, group characteristic analysis and the like. However, an important part in how to recover the network topology through the acquired network part information is to estimate the network admission distribution, because the admission information is potentially hidden in the random walk process. The recovery of the network topology structure can be carried out only by the estimation of the in-degree information, namely the estimation of the network in-degree distribution, thereby further obtaining the characteristics of the whole network.
In the conventional method for estimating the incoming degree information, by using the outgoing degree information which can be collected in the random walk process, when the incoming degree edge and the outgoing degree edge of a node in a network are highly symmetrical, that is, when the network nondirectivity degree is high (nondirectivity, that is, the ratio of the nondirectional edges), an estimation method EST _ out based on the outgoing degree information can be obtained:
wherein,represents an estimate of the in-degree distribution of the network,an estimate representing the out-of-degree distribution of the network, qd(kout) Is the out-degree distribution of the samples obtained by random walk sampling.
However, for online social networks, the relationships or behaviors between users are directional, e.g., "follow" behavior may be both "follow" and "get followed" relationships; the "election behavior" may be an "election" or "elected" relationship, and so on. Thus, the edges of the network may be divided into "in-degree edges" and "out-degree edges" to describe the relationships (edges) that "point" to the node and the relationships (edges) that point to other nodes, respectively. And in most cases the anisotropy in a directed network is not strong. Therefore, the estimation of the degree of entry information obtained by equation (1) causes a large deviation, and therefore, it is necessary to solve the problem of estimating the degree of entry information in the directed network.
Disclosure of Invention
The technical problem to be solved by the invention is as follows: because the estimation method of the network entry information in the prior art is an estimation method through the exit information when the network nondirectivity degree is higher, when the method is applied to a social network with higher directivity, the estimated entry information has larger error, so that the user behavior in the network cannot be well known and the network topological structure cannot be restored through the entry information, and the random walk access frequency-based entry information estimation method with smaller entry information estimation error for the directed network is provided.
In order to solve the problem, the technical scheme adopted by the invention is as follows:
a method for estimating the incoming degree information based on the random walk access frequency number comprises the following steps:
step 1: randomly selecting a seed node which is randomly walked from a directed network of the information of the degree of admission to be estimated, wherein the seed node is any node of the network, then implementing random walk, and randomly selecting a subsequent node which is randomly walked from a neighbor node of the current node;
step 2: in the random walk process, the number x of times each node i is repeatedly visited is recordedi；
And step 3: when the number N of walking steps is equal to the number N of nodes of the network, counting the number x of times each node i is visitedi；
And 4, step 4: estimating and outputting the in-degree information according to the counted number of times that each node i is visited;
wherein m isiIs visited x in the random walk processiThe number of secondary nodes.
The invention also provides a network admission information estimation system based on the random walk access frequency number, which is characterized in that: the method comprises a processor and a memory connected with the processor, wherein the memory stores a program of an incoming degree information estimation method based on random walk access frequency, and the program of the incoming degree information estimation method based on random walk access frequency realizes the steps of the method when being executed by the processor.
Compared with the prior art, the invention has the following beneficial effects:
the method for estimating the access information based on the random walk access frequency number has the advantages that research finds that when the step number of the random walk is the same as the number of network nodes, the number (frequency number) of the accessed nodes in the random walk process is approximately in direct proportion to the access information, so that the access information is estimated by counting the number of the accessed nodes in the random walk process when the problem of nondirectional failure in a directed network is solved, the error of the estimated access information is small, and the estimation efficiency is high.
Drawings
FIG. 1 is a flow chart of the present invention;
FIG. 2 is a diagram of the comparison of the estimated results obtained in different real networks with the real distribution, wherein (a) wiki election network (WEL), (b) Edinburgh vocabulary association network (EAT), (c) Stanford hyperlink network (SFH), and (d) Amazon recommendation network (AMR);
FIG. 3 is a diagram of D obtained by an estimation method of in-degree information and out-degree information on different real networksKSAnd (4) comparing the values. Wherein (a) wiki election network (WEL), (b) Edinburgh vocabulary association network (EAT),(c) stanford hyperlink network (SFH), and (d) Amazon recommendation network (AMR). 100 simulations were performed on each network.
Detailed Description
Fig. 1 to 3 show an embodiment of an incoming degree information estimation method based on random walk access frequency according to the present invention.
First, a method for estimating the degree of entry information will be described, in which the number of steps of random walk is the same as the number of network nodes, and the number of times (frequency) that a node is accessed during the random walk is approximately proportional to its degree of entry.
Suppose that n-step random walk is implemented in the directed network, the seed node of the random walk is 1, the seed selection strategy is random selection, and the subsequent nodes are randomly selected by the neighbor nodes of the current node. Then for any one degree of in isCan be modeled approximately by n Bernoulli experiments (n Bernoulli trials):
wherein XiRandom variable, p, representing the number of times node i is visited in random walksiIs the probability that node i may be visited in a random walk (i.e., the sample entry probability). Therefore, XiThe expectation of (c) may be expressed as:
E[Xi]＝npi. (3)
the literature: lu X, Malmros J, Liljeros F, et al]Electronic Journal of Statistics,2013,7(1):292-iApproximately is equal toIts penetrationIn direct proportion, namely:
wherein < kinAnd > represents the average in-degree of the network, and N is the number of nodes of the network. Bringing (4) into (3) can bring XiThe desired representation of (a) is:
if the number of steps N of the random walk is set to N, then
That is, the number of times (frequency) a node is accessed during random walk at this time is approximately equal to its degree of entryIs in direct proportion. So one scale (scaling) scaled estimate of the in-degree information can be approximately obtained:
wherein m isiIs visited x in the random walk processiThe number of secondary nodes. In this embodiment, the method for estimating the in-degree information is referred to as EST _ rw.
The specific method for estimating the in-degree information comprises the following steps:
a method for estimating the incoming degree information based on the random walk access frequency number comprises the following steps:
step 1: randomly selecting a seed node which is randomly walked from a directed network of the information of the degree of admission to be estimated, wherein the seed node is any node of the network, then implementing random walk, and randomly selecting a subsequent node which is randomly walked from a neighbor node of the current node;
step 2: in the random walk process, the number x of times each node i is repeatedly visited is recordedi；
And step 3: when the number N of walking steps is equal to the number N of nodes of the network, counting the number x of times each node i is visitedi；
And 4, step 4: estimating and outputting the in-degree information according to the counted number of times that each node i is visited;
wherein m isiIs visited x in the random walk processiThe number of secondary nodes.
The invention also provides a network admission information estimation system based on the random walk access frequency number, which is characterized in that: the method comprises a processor and a memory connected with the processor, wherein the memory stores a program of an incoming degree information estimation method based on random walk access frequency, and the program of the incoming degree information estimation method based on random walk access frequency realizes the steps of the method when being executed by the processor.
The proposed method of estimating the inbound information of the directed network is verified below by using 4 real directed networks. They are (1) Wikipedia election network (WEL), in which nodes represent users in Wikipedia; the directed edge from node i to node j in the network indicates that user i votes for user j. (2) The Edinburgh Association network (EAT), in which network nodes represent English words and are represented by directed edges from node i to node j, which will have a response to word j if stimulated by word i in the user's experiment. (3) Stanford hyperlink network (SFH): the nodes in the network represent different web pages on the Stanford university homepage; a directed edge pointing to node j from node i indicates that web page i has a hyperlink pointing to web page j. (4) Amazon recommendation network (AMR): nodes in the network represent different goods, and a directed edge directed by node i to node j indicates that goods j are purchased at the same time goods i are purchased. In order to make all the nodes in the network reachable (reachable), this embodiment extracts the largest Connected Component (GCC) of the 4 networks to obtain the final experimental network. The main network statistics for these several experimental networks are shown in table 1.
TABLE 1 basic network statistics for an experimental network
Network Number of nodes N Number of edges E
Wiki election network 1,300 39,437
Edinburgh vocabulary association network 7,751 235,476
Stanford hyperlink network 150,532 1,576,314
Amazon recommendation network 395,234 3,301,092
For simulation experiments of in-degree information estimation, this embodiment will be performed in four real networks (WEL, EAT, SFH and AMR). In each simulation, a node in the network is randomly selected as an initial seed node for random walk, and then the next walk node is randomly selected from the neighbors of the current node in each step. And setting the number of steps of random walk as the number N of nodes of the network. And recording the repeated access condition of the node and the outbound information of the node in the process of walking. This example performed 100 simulations for each network.
In each simulation, we will use two methods to estimate the in-degree information of the network, i.e. we will use
(I) An estimation method of in-degree information, EST _ rw;
(II) conventional method based on out-of-order information, EST _ out.
To compare the performance of the two methods, K-S statistics were used to measure the similarity of their derived estimates and true in-degree information. The specific process is as follows.
First, the data is normalized (normalization), and the true in-degree information and the data collected by the estimation method (EST _ rw: frequency of node visits; EST _ out: sample node out) are projected onto the same scale:
for computational convenience, we can combine zminIs set to 1, zmaxSet to 100, the value of y in the above equation will be projected to [1,100 ]]Projecting the real in-degree information, wherein the y value in the formula is the real in-degree of the node; for the EST _ rw method, the y value in the above formula is the frequency of the nodes accessed in the N-step random walks; for the EST _ out method, the y value in the above equation is the degree of departure of the sample node, ymaxAnd yminCorresponding respectively to the maximum and minimum values of the observed values expressed above. y ismaxAnd yminThe different methods are different quantities, specifically: if it is the conventional method EST _ out for comparison, ymaxAnd yminFor maximum and minimum values representing degrees, y is given for the EST _ rw method proposedmaxAnd yminRepresenting the maximum and minimum values of the access frequency. If it is true for comparison, ymaxAnd yminThe maximum and minimum values of true in-degree.
The projected data is then used to calculate the projected distribution of truth and its estimates by both methods (for the proposed EST _ rw, equation (7) is used; for EST _ out, equation (1) is used), respectively. And finally, calculating K-S statistic between the projected real distribution and the estimated distribution obtained by the two methods. The K-S statistic is the basis for rejecting the null hypothesis in the Komogorov-Smirnov test (KS test), i.e. for determining whether two distributions have consistency (elementary); it is used in this example simply to measure the similarity (similarity) between the true distribution and the estimated distribution:
DKS＝maxz{|F'(z)-F(z)|}. (9)
where z represents a value range of the post-projection (normalized) entrance information, and F (z) and F' (z) represent cumulative distribution functions (normalized) of the true entrance distribution and the estimated distribution (note that normalized), respectively. In the formula DKSThe maximum distance of these two cumulative degree distribution functions is described, in general, if DKSIs small, the estimated distribution has a high similarity in shape and position to the true distribution, otherwise, there is a high similarity between themThe similarity of (c) is low. Therefore, it can be said that if one estimation method performs better than the other, it yields DKSThe value is relatively small.
The results of simulation experiments on four real networks are as follows. First, the difference between the estimated distribution and the true distribution is visually compared, and the experimental result is shown in fig. 2. It can be seen that: compared with the traditional method based on the out-degree information, the new method has the advantages that the estimation result is better, and the estimated result is closer to the real in-degree information. In the web network, the EAT network and the SFH network, we can visually observe that the distribution obtained by EST _ rw is more similar to the real distribution in shape, and the distance between the two is much smaller than the distance between the distribution estimated by EST _ out and the real distribution. For the AMR network, although the EST _ rw estimate results in a distribution with a shape deviating somewhat from the true distribution in the first half, its overall shape is much closer to the true distribution than the result from EST _ out as a whole.
Then, the results of EST _ rw and EST _ out estimations, i.e., index D, are quantitatively analyzedKSThe difference between them and the real distribution is measured, and the specific result is shown in fig. 3. It can be seen that in these four real networks, EST _ rw gets DKSAll of which are smaller than the results obtained by EST _ out. Specifically, D obtained from EST _ rwKSThe average ratio EST _ out is 0.29 less in the WEL network, 0.60 less in the EAT network, 0.78 less in the SFH network, and 0.85 less in the AMR network. That is, EST _ rw results in an estimation that is more similar to the true distribution than the corresponding EST _ out results.
The above results are all very good illustrations of the error of the in-degree estimation method EST _ rw proposed by the present invention being smaller than that of the out-degree estimation method. Meanwhile, the distribution estimated by the method has higher similarity with the real distribution no matter in a model network or a real network.
Compared with the method of wandering the whole network (referred to as the global acquisition method for short), although the method provided by the invention cannot obtain accurate entry information after all or most of the exit edges in the network are acquired like the global acquisition method, the efficiency of the method provided by the invention is far higher than that of the global acquisition method. If all outgoing edges of the network are to be obtained, each edge is traversed at least once, that is, at least the number of steps of random walk to be executed is the total number of edges of the whole network; the number of steps of the random walk set by the invention is the same as the number of nodes of the network, namely, only the edges with the same number as the number of the nodes of the network need to be accessed; therefore, the efficiency of the present invention is < k > times of the global acquisition method (< k > is the average degree of the network).
In addition, compared with the method for delivering, the new method does not need to collect extra data such as delivering in the random walk process, and only needs to record the accessed times; the new method is also more efficient than the out-of-date method from a data collection volume perspective, requiring less process data to be stored.
The above is only a preferred embodiment of the present invention, and the protection scope of the present invention is not limited to the above-mentioned embodiments, and all technical solutions belonging to the idea of the present invention belong to the protection scope of the present invention. It should be noted that modifications and embellishments within the scope of the invention may be made by those skilled in the art without departing from the principle of the invention.

Claims (2)

1. A complex network entry information estimation method based on random walk access frequency is characterized in that: the method comprises the following steps:
step 1: randomly selecting a seed node which is randomly walked from a directed network of the information of the degree of admission to be estimated, wherein the seed node is any node of the network, then implementing random walk, and randomly selecting a subsequent node which is randomly walked from a neighbor node of the current node;
step 2: in the random walk process, the number x of times each node i is repeatedly visited is recordedi；
And step 3: when the number N of walking steps is equal to the number N of nodes of the network, counting the number x of times each node i is visitedi；
And 4, step 4: estimating the degree of entry information p according to the counted number of times each node i is visitedd(xi) And outputting;
wherein m isiIs visited x in the random walk processiThe number of secondary nodes.
2. A complex network entry information estimation system based on random walk access frequency is characterized in that: comprising a processor and a memory connected to said processor, said memory storing a program of a random walk access frequency based approach information estimation method, said program of a random walk access frequency based approach information estimation method being executed by said processor to implement the steps of the method of any of the previous claims 1-3.
CN201811632238.0A 2018-12-29 2018-12-29 Method and system for estimating incoming degree information based on random walk access frequency number Active CN109657160B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811632238.0A CN109657160B (en) 2018-12-29 2018-12-29 Method and system for estimating incoming degree information based on random walk access frequency number

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811632238.0A CN109657160B (en) 2018-12-29 2018-12-29 Method and system for estimating incoming degree information based on random walk access frequency number

Publications (2)

Publication Number Publication Date
CN109657160A true CN109657160A (en) 2019-04-19
CN109657160B CN109657160B (en) 2023-01-06

Family

ID=66117905

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811632238.0A Active CN109657160B (en) 2018-12-29 2018-12-29 Method and system for estimating incoming degree information based on random walk access frequency number

Country Status (1)

Country Link
CN (1) CN109657160B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111371619A (en) * 2020-03-10 2020-07-03 广州大学 Method and system for estimating number of users of instant messaging network

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100121792A1 (en) * 2007-01-05 2010-05-13 Qiong Yang Directed Graph Embedding
US20100125572A1 (en) * 2008-11-20 2010-05-20 Yahoo! Inc. Method And System For Generating A Hyperlink-Click Graph
CN106530097A (en) * 2016-10-11 2017-03-22 中国人民武装警察部队工程大学 Oriented social network key propagation node discovering method based on random walking mechanism
CN106886524A (en) * 2015-12-15 2017-06-23 天津科技大学 A kind of community network community division method based on random walk
CN107276793A (en) * 2017-05-31 2017-10-20 西北工业大学 The node importance measure of random walk is redirected based on probability
CN108600013A (en) * 2018-04-26 2018-09-28 北京邮电大学 The overlapping community discovery method and device of dynamic network

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100121792A1 (en) * 2007-01-05 2010-05-13 Qiong Yang Directed Graph Embedding
US20100125572A1 (en) * 2008-11-20 2010-05-20 Yahoo! Inc. Method And System For Generating A Hyperlink-Click Graph
CN106886524A (en) * 2015-12-15 2017-06-23 天津科技大学 A kind of community network community division method based on random walk
CN106530097A (en) * 2016-10-11 2017-03-22 中国人民武装警察部队工程大学 Oriented social network key propagation node discovering method based on random walking mechanism
CN107276793A (en) * 2017-05-31 2017-10-20 西北工业大学 The node importance measure of random walk is redirected based on probability
CN108600013A (en) * 2018-04-26 2018-09-28 北京邮电大学 The overlapping community discovery method and device of dynamic network

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
LAI,DR;LU,HT;NARDINI,C: "Extracting weights from edge directions to find communities in directed networks", 《IEEE》 *
RIBEIRO,B;WANG,PH;MURAI,F;TOWSLEY,D: "Sampling Directed Graphs with Random Walks", 《JOURNAL OF STATISTICAL MECHANICS:THEORY AND EXPERIMENT》 *
SANTO FORTUNATO,MARIAN BOGUNA,ALESSANDRO FLAMMINI,FILIPPO MENCZE: "Approximating PageRank from In-Degree", 《SPRINGER LINK》 *
SHEN LUYI, WANG XIAOFAN: "Bi-graph Random Walk Sampling of Directed Online Social", 《IEEE》 *
翟柄宇: "大型在线社交网络（OSN）用户采样、测量、评价关键问题研究", 《中国优秀硕士学位论文全文数据库信息科技辑》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111371619A (en) * 2020-03-10 2020-07-03 广州大学 Method and system for estimating number of users of instant messaging network
CN111371619B (en) * 2020-03-10 2022-06-10 广州大学 Method and system for estimating number of users of instant messaging network

Also Published As

Publication number Publication date
CN109657160B (en) 2023-01-06

Similar Documents

Publication Publication Date Title
CN110570111A (en) Enterprise risk prediction method, model training method, device and equipment
US10902025B2 (en) Techniques for measuring a property of interest in a dataset of location samples
Xin et al. Deep community detection in topologically incomplete networks
CN109145516B (en) Analog circuit fault identification method based on improved extreme learning machine
CN109840873A (en) A kind of Cross Some Region Without Data Hydro-Model Parameter Calibration Technology fields method based on machine learning
CN111274495A (en) Data processing method and device for user relationship strength, computer equipment and storage medium
Crama et al. Power indices and the measurement of control in corporate structures
CN111128398A (en) Epidemic disease infected person number estimation method based on population migration big data
CN107679626A (en) Machine learning method, device, system, storage medium and equipment
CN105719033A (en) Method and device for identifying risk in object
CN104112062A (en) Method for obtaining wind resource distribution based on interpolation method
Liu et al. House price modeling over heterogeneous regions with hierarchical spatial functional analysis
Zounemat-Kermani Investigating chaos and nonlinear forecasting in short term and mid-term river discharge
CN109345011A (en) A kind of Air-conditioning Load Prediction method and system returning forest based on depth
CN109657160B (en) Method and system for estimating incoming degree information based on random walk access frequency number
CN111325255B (en) Specific crowd delineating method and device, electronic equipment and storage medium
CN117056970A (en) Privacy feature protection method and system based on graph neural network
CN108647189B (en) Method and device for identifying user crowd attributes
CN114820219B (en) Complex network-based fraud community identification method and system
Amiri et al. Forecasting seasonality in prices of potatoes and onions: challenge between geostatistical models, neuro fuzzy approach and Winter method
CN114581086A (en) Phishing account detection method and system based on dynamic time sequence network
Peng et al. Uck-means: A customized k-means for clustering uncertain measurement data
Wang et al. FCM algorithm and index CS for the signal sorting of radiant points
Dwivedi et al. Study of fuzzy based classifier parameter across spatial resolution
Krishnamurthy et al. Segregation in social networks: Markov bridge models and estimation

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant