CN108319677A - The alignment schemes of the cyberrelationship figure of dynamic change - Google Patents
The alignment schemes of the cyberrelationship figure of dynamic change Download PDFInfo
- Publication number
- CN108319677A CN108319677A CN201810089607.XA CN201810089607A CN108319677A CN 108319677 A CN108319677 A CN 108319677A CN 201810089607 A CN201810089607 A CN 201810089607A CN 108319677 A CN108319677 A CN 108319677A
- Authority
- CN
- China
- Prior art keywords
- node
- seed
- alignment
- cyberrelationship
- aligned
- 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.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9024—Graphs; Linked lists
-
- 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—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
- G06Q50/01—Social networking
Abstract
Include choosing initial seed respectively for changing front and back cyberrelationship figure the invention discloses a kind of alignment schemes of the cyberrelationship figure of dynamic change；Degree sequence sequence to the neighbor node of initial seed, and calculate the similitude between seed node according to the degree series after sequence；The node for obtaining the front and back cyberrelationship figure of variation forms initial seed to set to collection merging；In current seed to the extension alignment being iterated in collection basis until exporting satisfactory alignment result.Network topological information is only utilized in the present invention, and using seed expansion algorithm, the similitude between calculate node carries out node alignment；In initial point selection, a small number of nodes of most possible accurate alignment are as seed in the node for only selecting the number of degrees big, with fault-tolerant characteristic, and in seed extends alignment procedure, also fault-tolerant thought is implemented, all only select a part of node in node to be aligned to being aligned as the wheel as a result, realizing the high-accuracy of alignment each time.
Description
Technical field
Present invention relates particularly to a kind of alignment schemes of the cyberrelationship figure of dynamic change.
Background technology
With the development of information technology, between person to person, object and object, people and object contact all than in the past more closely.
So, with close and Smart-Its development contacted between person to person, object and object, people and object, information technology
Even more important is also just become for the processing contacted between person to person, object and object, people and object.
Contacting between person to person, object and object, people and object, after mathematical modeling, essence is exactly many pieces of network
Relational graph.By taking interpersonal cyberrelationship figure as an example：In the research and application for social networks, usually by social network
User and its relation form in network turn to a figure.Node in figure indicates that the user in social networks, the side in figure indicate
Relationship between user.In actual social networks, user may increase friend or delete friend at any time, so social networks closes
Be figure it is constantly to change.How the node mapping social network relationships figure of dynamic change between, i.e., pair of two figure are realized
Together, a problem in being social networks research and applying.Its reason is：System is for the purpose of protection privacy of user, society
It hands over network data to generally employ anonymization processing before publication, that is, hides the attribute information of user such as name, therefore
So that existing common relational network recognizer can not directly be corresponded to different social networks by information such as address names and be closed
It is the node of figure, so that existing network relation recognition method is no longer desirable for the identification of cyberrelationship now field.
Invention content
The purpose of the present invention is to provide a kind of cyberrelationship figure alignment that can quickly and correctly carry out dynamic change
Method.
The alignment schemes of the cyberrelationship figure of this dynamic change provided by the invention, include the following steps：
S1. for the cyberrelationship figure G before the variation and cyberrelationship figure G ' after variation, the number of degrees in two figures are obtained respectively
Maximum m1 node is as initial seed；
S2. the degree sequence of the neighbor node for each initial seed that obtaining step S1 is obtained and sequence, and calculate sequence
The similitude of degree series afterwards；
S3. for each initial seed in G, the highest node of similarity is found in G ' and forms G to G's '
Both candidate nodes are to set；
S4. for each initial seed in G ', the highest node of similarity is found in G and forms G ' and arrives G's
Both candidate nodes are to set；
S5. the both candidate nodes pair of the G ' Dao the G both candidate nodes of obtained G to the G ' of step S3 obtained set and step S4
Set, seeks two intersection of sets collection, then takes the maximum n1 of similarity to node as initial seed pair in intersection
Set；The n1<m1；
S6. to current seed to the neighbor node of all nodes in set, selectance is maximum and is not belonging to seed to set
Preceding m2 node, as epicycle node to be aligned and be denoted asWith
S7. the arbitrary node to be aligned step S6 obtainedWithCalculate node u's and v to be aligned
Second similar value；
S8. according to the second similar value of step S7 obtained arbitrary node u and arbitrary node v, each to be waited in set G pair
Neat node finds out the highest node of the second similar value in set G ', is formed from set G to the both candidate nodes of set G ' to set；
S9. according to the second similar value of step S7 obtained arbitrary node u and arbitrary node v, each to be waited in set G '
Alignment node finds out the highest node of the second similar value in set G, is formed from set G ' to the both candidate nodes of set G to collection
It closes；
S10. both candidate nodes that both candidate nodes that step S8 is obtained obtain set and step S9 are sought to intersection of sets collection,
Then it takes the highest n2 of the second similar value to be added to existing seed to set to node in intersection, forms new seed to collection
It closes；n2<m2；
S11. the updated seeds of judgment step S10 are to gathering the alignment whether all align or satisfaction are previously set
Ratio：
If so, exporting updated seed to gathering as final alignment result；
If it is not, step S6~S11 is then repeated, until the updated seeds of step S10 are to gathering all align or expiring
The alignment ratio being previously set enough.
The similitude of the orderly degree series of calculating neighbor node described in step S2, is specially counted using following formula
It calculates：
S (u, v) is the similitude of node u and node v in formula, and R (*) indicates that the orderly degree series of neighbor node of node (are pressed
Ascending order arranges), len (*) indicates that the length of orderly degree series, dis (R (u), R (v)) indicate the neighbor node of node u and node v
The distance of orderly degree series, the corresponding value of last row of value is Distance matrix D is1 (R (u), R (v)) last column；Institute
The calculating principle for stating Distance matrix D is1 (R (u), R (v)) is：
R (u) × R (v)=0, Dis1 if (R (u), R (v))=max { R (u), R (v) }；
If R (u) × R (v) ≠ 0,
Dis1 (R (u), R (v))=min { D (R (u) -1, R (v))+1, D (R (u) -1, R (v))+1, unequal (R (u), R
(v))}；
In formula,
The similitude of calculating node to be aligned described in step S7, specially calculates the second similar value using following formula：
Score (u, v)=α * N (u, v)+(1- α) * s (u, v)
Score (u, v) is the second similar value in formula, and α is regulation coefficient and 0 ＜ α ＜ 1, N (u, v) indicate node u and node
The seed number being aligned present in the neighbor node of v；S (u, v) indicates the degree of order of the neighbor node of node u and node v
The similar value of sequence.
The alignment schemes of the cyberrelationship figure of this dynamic change provided by the invention, are only utilized network topological information,
Using seed expansion algorithm, the similitude between calculate node carries out node alignment；In initial point selection, only select the number of degrees big
Node in a small number of nodes of most possible accurate alignment be used as seed, there is fault-tolerant characteristic, and extend and be aligned in seed
Cheng Zhong also implements fault-tolerant thought, and a part of node in node to be aligned is all only selected to be tied to being aligned as the wheel each time
Fruit realizes the high-accuracy of alignment.
Description of the drawings
Fig. 1 is the method flow diagram of the method for the present invention.
Specific implementation mode
It is flow chart of the method for the present invention as shown in Figure 1：The cyberrelationship figure of this dynamic change provided by the invention
Alignment schemes include the following steps：
S1. for the cyberrelationship figure G before the variation and cyberrelationship figure G ' after variation, the number of degrees in two figures are obtained respectively
Maximum m1 node is as initial seed；
S2. the degree sequence of the neighbor node for each initial seed that obtaining step S1 is obtained and sequence, and according to sequence
Degree series afterwards calculate the similitude of seed node；Specially calculated using following formula：
S (u, v) is the similitude of node u and node v in formula, and R (*) indicates that the orderly degree series of neighbor node of node (are pressed
Ascending order arranges), len (*) indicates that the length of orderly degree series, dis (R (u), R (v)) indicate the neighbor node of node u and node v
The distance of orderly degree series, the corresponding value of last row of value is Distance matrix D is1 (R (u), R (v)) last column；Institute
The calculating principle for stating Distance matrix D is1 (R (u), R (v)) is：
R (u) × R (v)=0, Dis1 if (R (u), R (v))=max { R (u), R (v) }；
If R (u) × R (v) ≠ 0,
Dis1 (R (u), R (v))=min { D (R (u) -1, R (v))+1, D (R (u) -1, R (v))+1, unequal (R (u), R
(v))}；
In formula,
S3. for each initial seed in G, the highest node of similarity is found in G ' and forms G to G's '
Both candidate nodes are to set；
S4. for each initial seed in G ', the highest node of similarity is found in G and forms G ' and arrives G's
Both candidate nodes are to set；
S5. the both candidate nodes pair of the G ' Dao the G both candidate nodes of obtained G to the G ' of step S3 obtained set and step S4
Set, seeks two intersection of sets collection, then takes the maximum n1 of similarity to node as initial seed pair in intersection
Set；The n1<m1；
S6. to current seed to the neighbor node of all nodes in set, selectance is maximum and is not belonging to seed to set
Preceding m2 node, as epicycle node to be aligned and be denoted asWith
S7. the arbitrary node to be aligned step S6 obtainedWithCalculate node u's and v to be aligned
Second similar value；The second similar value is specially calculated using following formula：
Score (u, v)=α * N (u, v)+(1- α) * s (u, v)
Score (u, v) is the second similar value in formula, and α is regulation coefficient and 0 ＜ α ＜ 1, N (u, v) indicate node u and node
The seed number being aligned present in the neighbor node of v；S (u, v) indicates the degree of order of the neighbor node of node u and node v
The similar value of sequence；
S8. according to the second similar value of step S7 obtained arbitrary node u and arbitrary node v, each to be waited in set G pair
Neat node finds out the highest node of the second similar value in set G ', is formed from set G to the both candidate nodes of set G ' to set；
S9. according to the second similar value of step S7 obtained arbitrary node u and arbitrary node v, each to be waited in set G '
Alignment node finds out the highest node of the second similar value in set G, is formed from set G ' to the both candidate nodes of set G to collection
It closes；
S10. both candidate nodes that both candidate nodes that step S8 is obtained obtain set and step S9 are sought to intersection of sets collection,
Then it takes the highest n2 of the second similar value to be added to existing seed to set to node in intersection, forms new seed to collection
It closes；n2<m2；
S11. the updated seeds of judgment step S10 are to gathering the alignment whether all align or satisfaction are previously set
Ratio：
If so, exporting updated seed to gathering as final alignment result；
If it is not, step S6~S11 is then repeated, until the updated seeds of step S10 are to gathering all align or expiring
The alignment ratio being previously set enough.
Claims (3)
1. a kind of alignment schemes of the cyberrelationship figure of dynamic change, include the following steps：
S1. for the cyberrelationship figure G before the variation and cyberrelationship figure G ' after variation, it is maximum that the number of degrees in two figures are obtained respectively
M1 node as initial seed；
S2. the degree sequence of the neighbor node for each initial seed that obtaining step S1 is obtained and sequence, and according to sequence after
Degree series calculate the similitude between initial seed；
S3. for each initial seed in G, the highest node of similarity is found in G ' and forms the candidate of G to G '
Node is to set；
S4. for each initial seed in G ', the highest node of similarity is found in G and forms the candidate that G ' arrives G
Node is to set；
S5. the both candidate nodes of G ' Dao G obtained to set and step S4 to the both candidate nodes of obtained G to the G ' of step S3 are to collecting
Close, seek two intersection of sets collection, then taken in intersection the maximum n1 of similarity to node as initial seed to collection
It closes；The n1<m1；
S6. to current seed to the neighbor node of all nodes in set, selectance is maximum and before being not belonging to seed to set
M2 node, as epicycle node to be aligned and be denoted asWith
S7. the arbitrary node to be aligned step S6 obtainedWithCalculate the second of node u and v to be aligned
Similar value；
S8. according to the second similar value of step S7 obtained arbitrary node u and arbitrary node v, for each section to be aligned in set G
Point finds out the highest node of the second similar value in set G ', is formed from set G to the both candidate nodes of set G ' to set；
S9. it is each to be aligned in set G ' according to the second similar value of step S7 obtained arbitrary node u and arbitrary node v
Node finds out the highest node of the second similar value in set G, is formed from set G ' to the both candidate nodes of set G to set；
S10. both candidate nodes that both candidate nodes that step S8 is obtained obtain set and step S9 are sought to intersection of sets collection, then
It takes the highest n2 of the second similar value to be added to existing seed to set to node in intersection, forms new seed to set；
n2<m2；
S11. the updated seeds of judgment step S10 are to gathering the alignment ratio whether all align or satisfaction are previously set
Rate：
If so, exporting updated seed to gathering as final alignment result；
If it is not, step S6~S11 is then repeated, until the updated seeds of step S10 are to gathering all align or meeting thing
The alignment ratio first set.
2. the alignment schemes of the cyberrelationship figure of dynamic change according to claim 1, it is characterised in that described in step S2
Calculating neighbor node orderly degree series similitude, specially calculated using following formula：
S (u, v) is the similitude of node u and node v in formula, and R (*) indicates that the orderly degree series of neighbor node of node (press ascending order
Arrangement), len (*) indicates that the length of orderly degree series, dis (R (u), R (v)) indicate that the neighbor node of node u and node v is orderly
The distance of degree series, the corresponding value of last row of value is Distance matrix D is1 (R (u), R (v)) last column；It is described away from
Calculating principle from matrix D is1 (R (u), R (v)) is：
R (u) × R (v)=0, Dis1 if (R (u), R (v))=max { R (u), R (v) }；
If R (u) × R (v) ≠ 0,
Dis1 (R (u), R (v))=min { D (R (u) -1, R (v))+1, D (R (u) -1, R (v))+1, unequal (R (u), R
(v))}；
In formula, unequal (R (u),
3. the alignment schemes of the cyberrelationship figure of dynamic change according to claim 2, it is characterised in that described in step S7
Calculating node to be aligned similitude, the second similar value is specially calculated using following formula：
Score (u, v)=α * N (u, v)+(1- α) * s (u, v)
Score (u, v) is the second similar value in formula, and α is regulation coefficient and 0 ＜ α ＜ 1, N (u, v) indicate node u's and node v
The seed number being aligned present in neighbor node；S (u, v) indicates the orderly degree series of the neighbor node of node u and node v
Similar value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810089607.XA CN108319677A (en) | 2018-01-30 | 2018-01-30 | The alignment schemes of the cyberrelationship figure of dynamic change |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810089607.XA CN108319677A (en) | 2018-01-30 | 2018-01-30 | The alignment schemes of the cyberrelationship figure of dynamic change |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108319677A true CN108319677A (en) | 2018-07-24 |
Family
ID=62891194
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810089607.XA Pending CN108319677A (en) | 2018-01-30 | 2018-01-30 | The alignment schemes of the cyberrelationship figure of dynamic change |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108319677A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110046194A (en) * | 2019-03-19 | 2019-07-23 | 阿里巴巴集团控股有限公司 | A kind of method, apparatus and electronic equipment of expanding node relational graph |
| CN110689050A (en) * | 2019-09-04 | 2020-01-14 | 大连理工大学 | Alignment method of multiple alarm surge sequences |
| CN111916149A (en) * | 2020-08-19 | 2020-11-10 | 江南大学 | Hierarchical clustering-based protein interaction network global comparison method |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103207884A (en) * | 2012-11-23 | 2013-07-17 | 浙江工业大学 | Method for matching weight iteration nodes between weighting networks |
| CN104978498A (en) * | 2015-04-16 | 2015-10-14 | 上海大学 | Adaptive method of biomolecule network topological structure |
| CN105808696A (en) * | 2016-03-03 | 2016-07-27 | 北京邮电大学 | Global and local characteristic based cross-online social network user matching method |
| US20170132226A1 (en) * | 2015-11-06 | 2017-05-11 | Facebook, Inc. | Suppressing entity suggestions on online social networks |
| CN106776881A (en) * | 2016-11-28 | 2017-05-31 | 中国科学院软件研究所 | A kind of realm information commending system and method based on microblog |
-
2018
- 2018-01-30 CN CN201810089607.XA patent/CN108319677A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103207884A (en) * | 2012-11-23 | 2013-07-17 | 浙江工业大学 | Method for matching weight iteration nodes between weighting networks |
| CN104978498A (en) * | 2015-04-16 | 2015-10-14 | 上海大学 | Adaptive method of biomolecule network topological structure |
| US20170132226A1 (en) * | 2015-11-06 | 2017-05-11 | Facebook, Inc. | Suppressing entity suggestions on online social networks |
| CN105808696A (en) * | 2016-03-03 | 2016-07-27 | 北京邮电大学 | Global and local characteristic based cross-online social network user matching method |
| CN106776881A (en) * | 2016-11-28 | 2017-05-31 | 中国科学院软件研究所 | A kind of realm information commending system and method based on microblog |
Non-Patent Citations (2)
| Title |
|---|
| SINA S, ROSENFELD A, KRAUS S.: "SAMI: an algorithm for solving the missing node problem using structure and attribute information", 《SOCIAL NETWORK ANALYSIS AND MINING》 * |
| 胡艳梅: "社交网络匹配算法研究与改进", 《中国博士学位论文全文数据库 信息科技辑》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110046194A (en) * | 2019-03-19 | 2019-07-23 | 阿里巴巴集团控股有限公司 | A kind of method, apparatus and electronic equipment of expanding node relational graph |
| CN110689050A (en) * | 2019-09-04 | 2020-01-14 | 大连理工大学 | Alignment method of multiple alarm surge sequences |
| CN110689050B (en) * | 2019-09-04 | 2022-03-04 | 大连理工大学 | Alignment method of multiple alarm surge sequences |
| CN111916149A (en) * | 2020-08-19 | 2020-11-10 | 江南大学 | Hierarchical clustering-based protein interaction network global comparison method |
| CN111916149B (en) * | 2020-08-19 | 2024-05-03 | 江南大学 | Hierarchical clustering-based protein interaction network global comparison method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Syakur et al. | Integration k-means clustering method and elbow method for identification of the best customer profile cluster | |
| CN108665323B (en) | Integration method for financial product recommendation system | |
| CN105808696B (en) | It is a kind of based on global and local feature across line social network user matching process | |
| CN108319677A (en) | The alignment schemes of the cyberrelationship figure of dynamic change | |
| CN102880644B (en) | Community discovering method | |
| CN103902988B (en) | A kind of sketch shape matching method based on Modular products figure with Clique | |
| CN107330020B (en) | User entity analysis method based on structure and attribute similarity | |
| WO2019001429A1 (en) | Multisource data fusion method and apparatus | |
| CN107301247B (en) | Method and device for establishing click rate estimation model, terminal and storage medium | |
| CN107273864A (en) | A kind of method for detecting human face based on deep learning | |
| CN108763956A (en) | A kind of stream data difference secret protection dissemination method based on fractal dimension | |
| CN107067164A (en) | A kind of index Method of fast estimating and system | |
| WO2020211146A1 (en) | Identifier association method and device, and electronic apparatus | |
| CN107679539B (en) | Single convolution neural network local information and global information integration method based on local perception field | |
| CN111178408A (en) | Health monitoring model construction method and system based on federal random forest learning | |
| CN106651978A (en) | Face image prediction method and system | |
| CN107277115A (en) | A kind of content delivery method and device | |
| CN104731887B (en) | A kind of user method for measuring similarity in collaborative filtering | |
| CN107945037A (en) | A kind of social networks based on node structure feature goes de-identification method | |
| CN110837568A (en) | Entity alignment method and device, electronic equipment and storage medium | |
| Jiang et al. | Consensus style centralizing auto-encoder for weak style classification | |
| WO2017201605A1 (en) | Large scale social graph segmentation | |
| CN107993156B (en) | Social network directed graph-based community discovery method | |
| RU2612608C2 (en) | Social circle formation system and method and computer data carrier | |
| CN111078859B (en) | Author recommendation method based on reference times |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180724 |