CN107357846A - The methods of exhibiting and device of relation map - Google Patents
The methods of exhibiting and device of relation map Download PDFInfo
- Publication number
- CN107357846A CN107357846A CN201710497163.9A CN201710497163A CN107357846A CN 107357846 A CN107357846 A CN 107357846A CN 201710497163 A CN201710497163 A CN 201710497163A CN 107357846 A CN107357846 A CN 107357846A
- Authority
- CN
- China
- Prior art keywords
- access path
- path
- associated nodes
- grid
- node
- 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
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/903—Querying
- G06F16/9038—Presentation of query results
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computational Linguistics (AREA)
- Software Systems (AREA)
- Processing Or Creating Images (AREA)
Abstract
The invention discloses a kind of methods of exhibiting of relation map and device.Wherein method includes：The path list between first object node and at least one second destination node is obtained, wherein, path list may include n access path, have m associated nodes in n access path；A minor sort is carried out to n access path according to the frequency that node occurs, and two minor sorts are carried out to n access path according to the similarity of access path；For each access path after two minor sorts, the coordinate of each associated nodes included in each access path is calculated respectively according to the dimension information at intended display interface；The coordinate of common points is merged to obtain the final coordinate of each common points；All nodes are plotted on intended display interface according to its coordinate, and draw line.Thus, it is possible to effective position of the distribution node on intended display interface, forms clean and tidy displaying.
Description
Technical field
The present invention relates to the methods of exhibiting and device of technical field of data processing, more particularly to a kind of relation map.
Background technology
At present, in the dependency relation between inquiring about destination node, user may wish to obtain and be closed on two surfaces sometimes
System compares the contact between the node become estranged.For example, so that destination node is enterprise as an example, user may need to obtain two surfaces
Contacting between enterprise A and enterprise B that co-relation is relatively become estranged.
In correlation technique, the relation map between destination node is obtained typically by relational query scheduling algorithm, wherein, should
Correlation in relation map between inclusion relation node and each node, then, using the method based on electric field simulation
The relation map is shown and is laid out, for example, bandwagon effect is as shown in Figure 1.
But the problem of presently, there are, is：It is shown and is laid out using the method based on electric field simulation, relation can be caused
Interface shape is larger shared by collection of illustrative plates, and shows that the utilization rate at interface is not high, especially, when the method application based on electric field simulation
When mobile terminal is to carry out the displaying of relation map and layout, because the screen of mobile terminal is smaller, it is necessary to which user is constantly sliding
Dynamic screen checks the relation map of displaying, causes Consumer's Experience to be deteriorated.
The content of the invention
The purpose of the present invention is intended at least solve one of above-mentioned technical problem to a certain extent.
Therefore, first purpose of the present invention is to propose a kind of methods of exhibiting of relation map.This method can cause
Relation map can effective relevant position of the distribution node on intended display interface, can not only be formed and neatly clearly shown
Effect, and intended display interface can be efficiently utilized, improve Consumer's Experience.
Second object of the present invention is to propose a kind of exhibiting device of relation map.
Third object of the present invention is to propose a kind of terminal device.
Fourth object of the present invention is to propose a kind of non-transitorycomputer readable storage medium.
To reach above-mentioned purpose, the methods of exhibiting for the relation map that first aspect present invention embodiment proposes, including：Obtain
Path list between first object node and at least one second destination node, wherein, the path list may include n even
Path is connect, there are m associated nodes in the n access path, wherein, the m associated nodes may include first mesh
Node, at least one second destination node and other associated nodes are marked, n is positive integer, and m is the positive integer more than 2；According to
The frequency that node occurs carries out a minor sort to the n access path, and described n is connected according to the similarity of access path
Connect path and carry out two minor sorts；For each access path after two minor sorts, according to the dimension information at intended display interface point
The coordinate of each associated nodes included in each access path is not calculated；Will be each in the n access path
The coordinate of common points merges respectively, and the final coordinate using the coordinate after merging as each common points；Root
The m associated nodes are plotted on the intended display interface according to the coordinate being calculated, while according to the link road
The m associated nodes being plotted on the intended display interface are carried out line by footpath.
The methods of exhibiting of relation map according to embodiments of the present invention, first object node and at least one second can be obtained
Path list between destination node, the path list may include n access path, have m association in the n access path
Node, and the access path for having common points in n access path is adjusted to adjacent position, and similar access path is adjusted
It is whole to arrive adjacent position, with n access path after being updated；Afterwards, for each access path after renewal, according to target
The dimension information at displaying interface calculates the coordinate of each associated nodes included in each access path respectively；Then, by n
The coordinate of each common points in access path merges respectively, and using the coordinate after merging as each common points
Final coordinate；Finally, associated nodes are plotted on intended display interface according to the coordinate being calculated, and draw line to obtain
To final relation map.So, relation map effectively distribution node can be enabled corresponding on intended display interface
Position, clean and tidy clearly bandwagon effect (as without situation about intersecting) can be not only formed, and can efficiently utilize target
Interface is shown, improves Consumer's Experience.
To reach above-mentioned purpose, the exhibiting device for the relation map that second aspect of the present invention embodiment proposes, including：Obtain
Module, for obtaining the path list between first object node and at least one second destination node, wherein, the path column
Table may include n access path, have m associated nodes in the n access path, wherein, the m associated nodes can wrap
The first object node, at least one second destination node and other associated nodes are included, n is positive integer, and m is more than 2
Positive integer；First order module, for carrying out a minor sort to the n access path according to the frequency that node occurs；The
Two order modules, two minor sorts are carried out to the n access path for the similarity according to access path；Computing module, use
Each access path after for two minor sorts, each connection is calculated according to the dimension information at intended display interface respectively
The coordinate of each associated nodes included in path；Coordinate merging module, for will be each common in the n access path
Merged respectively with the coordinate of node, and the final coordinate using the coordinate after merging as each common points；Displaying
Module, for the m associated nodes to be plotted in into the intended display interface, while basis according to the coordinate being calculated
The m associated nodes being plotted on the intended display interface are carried out line by the access path.
The exhibiting device of relation map according to embodiments of the present invention, first object node and at least one second can be obtained
Path list between destination node, the path list may include n access path, have m association in the n access path
Node, and the access path for having common points in n access path is adjusted to adjacent position, and similar access path is adjusted
It is whole to arrive adjacent position, with n access path after being updated；Afterwards, for each access path after renewal, according to target
The dimension information at displaying interface calculates the coordinate of each associated nodes included in each access path respectively；Then, by n
The coordinate of each common points in access path merges respectively, and using the coordinate after merging as each common points
Final coordinate；Finally, associated nodes are plotted on intended display interface according to the coordinate being calculated, and draw line to obtain
To final relation map.So, relation map effectively distribution node can be enabled corresponding on intended display interface
Position, clean and tidy clearly bandwagon effect (as without situation about intersecting) can be not only formed, and can efficiently utilize target
Interface is shown, improves Consumer's Experience.
To reach above-mentioned purpose, terminal device that third aspect present invention embodiment proposes, including：Memory, processor
And the computer program that can be run on the memory and on the processor is stored in, the computing device described program
When, realize described in first aspect present invention embodiment be collection of illustrative plates methods of exhibiting
To reach above-mentioned purpose, non-transitorycomputer readable storage medium that fourth aspect present invention embodiment proposes,
Computer program is stored thereon with, realizes that described in first aspect present invention embodiment be figure when described program is executed by processor
The methods of exhibiting of spectrum.
The additional aspect of the present invention and advantage will be set forth in part in the description, and will partly become from the following description
Obtain substantially, or recognized by the practice of the present invention.
Brief description of the drawings
Of the invention above-mentioned and/or additional aspect and advantage will become from the following description of the accompanying drawings of embodiments
Substantially and it is readily appreciated that, wherein：
Fig. 1 is the bandwagon effect exemplary plot according to relation map of the prior art；
Fig. 2 is the flow chart of the methods of exhibiting of relation map according to an embodiment of the invention；
Fig. 3 is the flow chart according to an embodiment of the invention that a minor sort is carried out to n access path；
Fig. 4 is the flow chart according to an embodiment of the invention that two minor sorts are carried out to n access path；
Fig. 5 is the flow chart of the coordinate according to an embodiment of the invention for calculating each associated nodes；
Fig. 6 is the bandwagon effect exemplary plot of relation map according to an embodiment of the invention；
Fig. 7 is the structural representation of the exhibiting device of relation map according to an embodiment of the invention；
Fig. 8 is the structural representation according to the exhibiting device of the relation map of a specific embodiment of the invention；
Fig. 9 is the structural representation of terminal device according to an embodiment of the invention.
Embodiment
Embodiments of the invention are described below in detail, the example of the embodiment is shown in the drawings, wherein from beginning to end
Same or similar label represents same or similar element or the element with same or like function.Below with reference to attached
The embodiment of figure description is exemplary, it is intended to for explaining the present invention, and is not considered as limiting the invention.
Below with reference to the accompanying drawings methods of exhibiting, device, terminal device and the storage of the relation map of the embodiment of the present invention are described
Medium.
Fig. 2 is the flow chart of the methods of exhibiting of relation map according to an embodiment of the invention.It should be noted that this
The methods of exhibiting of the relation map of inventive embodiments can be applied to the exhibiting device of the relation map of the embodiment of the present invention, the displaying
Device can be configured in terminal device.Wherein, the terminal device can be mobile terminal (such as mobile phone, tablet personal computer, individual digital
Assistants etc. have the hardware device of various operating systems), PC (Personal Computer, personal computer) machine etc..
As shown in Fig. 2 the methods of exhibiting of the relation map can include：
S210, the path list between first object node and at least one second destination node is obtained, wherein, the path
List may include n access path, have m associated nodes in the n access path, wherein, the m associated nodes may include
The first object node, at least one second destination node and other associated nodes, n are positive integer, and m is the positive integer more than 2.
Wherein, in an embodiment of the present invention, at least one second destination node can be regarded as one or more second mesh
Mark node.In addition, the destination node can be enterprise (or company), individual etc..
For example, the methods of exhibiting of the relation map of the embodiment of the present invention can be applied to mobile terminal, the mobile terminal
Can provide the user the application program with input function, user can be inputted by using the input function first object node and
At least one second destination node.When detecting that user has carried out input operation, the first object section of user's input can be received
Point and at least one second destination node.
, can be according to default relational query after the first object node and the second destination node of user's input is received
Algorithm obtains the path list between the first object node and the second destination node, and the path list may include n link road
Footpath, wherein, the access path may be used to indicate from first object node, successively by other one or more associated nodes
The path connected when at least one second destination node.
S220, one minor sort is carried out to n access path according to the frequency that node occurs, and according to the similar of access path
Degree carries out two minor sorts to n access path.
It is appreciated that in access path between first object node and at least one second destination node, may
Existing has identical associated nodes on two or more pieces access path, now the associated nodes can be referred to as into common points.
In this step, all access paths between first object node and at least one second destination node are being obtained
Afterwards, the frequency that can occur according to associated nodes, it is preferential to adjust the suitable of access path corresponding to the high associated nodes of frequency of occurrence
Sequence, you can the access path with common points is adjusted to adjacent position, and then similar access path is adjusted to adjoining
Position.
As a kind of example, as shown in figure 3, the above-mentioned frequency occurred according to node is once arranged n access path
The specific implementation process of sequence (access path that will have common points is adjusted to adjacent position) may include following steps：
S2201, according to the number of access path where associated nodes, m associated nodes are ranked up, after obtaining sequence
Node listing.
First, the path list obtained in above-mentioned steps S210 can be recorded as to P { p1, p2, p3 ... ..., pn }, wherein,
P1, p2, p3, pn represent n different access paths between first object node and the second destination node respectively.Afterwards, can build
Stand using associated nodes as key, the Kazakhstan that associated nodes place access path is values (representing one or more access paths)
Uncommon table H.Wherein, the access path where each associated nodes and the associated nodes is contained in Hash table H, for example,
Key1 corresponds to values (p1, p3, p9), and key2 corresponds to values (p2, p4, p5, p6) ....
Afterwards, the key (i.e. associated nodes) in Hash table H can be entered according to the number of access path where associated nodes
Row sequence, the node listing N after being sorted, for example, node listing N can be { key2, key1 ... }.
S2202, i-th of associated nodes is chosen from node listing, correspondingly, saved i-th of association from path list
Access path where point is moved to the starting position of path list to update path list, wherein, 1≤i≤m.
That is, choosing an associated nodes key successively from node listing N, correspondingly, selected from path list P
Go out one or more access path values corresponding to H (key), and these access paths are moved to path list P beginning
Position, path list P is updated with this.
S2203, based on the path list after renewal, step S2202 and S2203 are repeated, until institute in node listing
Untill associated nodes of the number of access path more than 1 have been selected.
Specifically, renewal list P caused by the step S2202 can be based on, repeats step S2202 and S2203,
Until in node listing N without access path number be more than 1 associated nodes, so as to obtain the path after a minor sort
List.
For example, values (p1, p3, p9), key2 are corresponded to by { key2, key1 ... ... }, key1 of node listing N
Corresponding values (p2, p4, p5, p6), path list P are that { p1, p2, p3, p4, p5, p6, p7, p8, p9, p10 ... ..., pn } is
Example, first, can choose 4 access paths (p2, p4, p5, p6) corresponding to first associated nodes key2 from node listing N,
Afterwards, 4 access paths corresponding to associated nodes key2 can be moved to path list P starting position, this is updated with this
Path list P is { p2, p4, p5, p6, p1, p3, p7, p8, p9, p10 ..., pn }.Afterwards, can be based on the path after the renewal
List P, second associated nodes key1 is chosen from node listing N, correspondingly, is selected from the path list P after the renewal
3 access paths (p1, p3, p9) corresponding to second associated nodes key1, and by 3 companies corresponding to associated nodes key1
Connect path be moved to renewal after path list P starting position, using this update path list P as p1, p3, p9, p2, p4,
p5,p6,p7,p8,p10,……,pn}。
So, after the path list after obtaining a minor sort, the path list after a minor sort can be carried out secondary
Sequence.As a kind of example, as shown in figure 4, the above-mentioned similarity according to access path carries out two minor sorts to n access path
The specific implementation process of (i.e. similar access path is adjusted to adjacent position) may include following steps：
S2211, j-th of access path is chosen from n access path after a minor sort, from n after a minor sort
Access path obtains and j-th of access path similarity highest access path, wherein, 1≤j≤n.
Wherein, in an embodiment of the present invention, the similarity of access path can pass through common points in two access paths
The number of number calculates, that is to say, that the number of the common points number in two access paths determines this two connections
Similarity degree between path.
S2212, will be with j-th of access path similarity highest access path, next company with j-th of access path
Connect path and carry out place-exchange.
S2213, since next access path of j-th of access path, step S2211-S2213 is repeated, directly
N access path after to a minor sort is all selected.
For example, by taking the n access path (the path list P ' after once updating) after a minor sort as an example, such as
Its result is { p1, p3, p9, p2, p4, p5, p6, p7, p8, p10 ... ..., pn }, first, the path after can once being updated from this
First access path p1 is sequentially selected in list P ', and selection is similar to access path p1 from access path below
Spend highest access path (such as access path p5)；Afterwards, by access path p1 next access path p3 and the link road
Footpath p5 carry out place-exchange, i.e., now path list P ' be updated to p1, p5, p9, p2, p4, p3, p6, p7, p8, p10 ... ...,
Pn }, since access path p1 next access path p5, selection and the company in the access path from list P ' behind p5
Path p5 similarity highest access paths (such as access path P8) are connect, afterwards, by access path p5 next access path
P9 and access path P8 carry out place-exchange, i.e., now path list P ' be updated to p1, p5, p8, p2, p4, p3, p6, p7,
P9, p10 ... ..., pn }, the rest may be inferred, until access path is all selected in the path list P ' after a minor sort, so as to
Obtain the path list P " after two minor sorts.Thus, similar access path adjacent position has been adjusted to.
S230, for each access path after two minor sorts, calculated respectively according to the dimension information at intended display interface
The coordinate of each associated nodes included in each access path.
Specifically, each path pi in the path list P " after two minor sorts is first traveled through, and according to intended display interface
Dimension information calculate the abscissas of all associated nodes in the pi of the path.Distinguish further according to the dimension information at intended display interface
Calculate the ordinate of each associated nodes in the pi of the path.As a kind of example, as shown in figure 5, the seat of each associated nodes
Mark can be calculated by following steps：
S231, obtain the dimension information at intended display interface.
It should be noted that the dimension information at the intended display interface can be set as the terminal corresponding to the intended display interface
Standby screen size solves.For example, when the screen size of the terminal device is larger, then the intended display interface can also be set
It is very big, so facilitate user to check the relation map finally shown.In addition, the dimension information can be by the shape at intended display interface
Shape determines that for example, when intended display interface is rectangle, then the dimension information may include wide and high；Intended display interface is circle
During shape, then the dimension information may include radius or diameter, or the intended display interface to can also be other shapes, then accordingly
Dimension information can be the critical size of the correspondingly-shaped.
It is appreciated that the intended display interface is for showing final association collection of illustrative plates, the intended display interface can be
Pre-set.So, in this step, when calculating the coordinate of each associated nodes, can first obtain will be final to show
The intended display interface of collection of illustrative plates is associated, and obtains the shape and size information at the intended display interface.
S232, intended display interface is partitioned into L*K grid, and the width of each grid is calculated according to dimension information
Value and height value, wherein, L is the length value of longest path in n access path, and K is the number of access path.Wherein, this is most
Long path can be regarded as the most access path of associated nodes included in the n access path, and the length value refers to the company
Connect the total number of associated nodes in path.
S233, for each access path after two minor sorts, calculated according to the first preset formula and the width value every
The abscissa of all associated nodes in individual access path.Wherein, in an embodiment of the present invention, first preset formula can be：
X=grid_w* (i+1/2)
Wherein, x is abscissa, and grid_w is the width value of grid, and i is i-th of access path after two minor sorts.
S234, according to the second preset formula and the height value, calculate in each access path between associated nodes most
It is closely-spaced.Wherein, in an embodiment of the present invention, second preset formula can be：
Grid_1h'=int (grid_1h/grid_h) * grid_h
Wherein, grid_1h' is minimum interval；Grid_1h=float (height)/n, wherein, float () is floating type
Data type, height are the height at intended display interface, and n is the number of the associated nodes included in each access path；
Grid_h is the height value of grid；Int () is downward bracket function.That is, can be first according to formula grid_1h=float
(height)/n calculates the minimum interval between associated nodes in current access path, then utilizes formula grid_1h'=int
(grid_1h/grid_h) * grid_h) correct, obtain final minimum interval.
S235, for each associated nodes in each access path, according to the 3rd preset formula, the height value and institute
Minimum interval is stated, calculates the ordinate of each associated nodes.Wherein, in an embodiment of the present invention, the 3rd preset formula can
For：
Y=int (grid_h/2+j*grid_1h')
Wherein, y is the ordinate of j-th of associated nodes, and int () is downward bracket function, and grid_h is height value, and j is
J-th of associated nodes in each access path, grid_1h' is minimum interval.
Thus, the abscissa and ordinate of each associated nodes can be calculated by above-mentioned steps S231-S235.
S240, the coordinate of each common points in n access path is merged respectively, and by the coordinate after merging
Final coordinate as each common points.
It is appreciated that in the coordinate for calculating each associated nodes included in each access path, two or two
Access path above can have common points, i.e. an associated nodes may be contained in two or more access paths
In, so, the common points can have multiple coordinates.
Therefore, in this step, need to be merged according to preset strategy to the coordinate of common points, and by the seat after merging
It is denoted as the final coordinate for the common points.Wherein, can be as a kind of example, the preset strategy：For abscissa, can first by
Abscissa in multiple coordinates of the common points, sorts from small to large, afterwards, median is taken from the abscissa after sequence,
The median can be as the final abscissa of the common points；, can be by multiple ordinates of the common points for ordinate
Final ordinate of the maximum as the common points.
Thus, the coordinate of all m associated nodes can be obtained by above-mentioned steps S230 and S240, so as to follow-up basis
The drafting of the coordinate finish relation collection of illustrative plates.
S250, m associated nodes are plotted on intended display interface according to the coordinate being calculated, while according to described
The m associated nodes being plotted on intended display interface are carried out line and mark the m associated nodes by access path
Between relation (as shown in Figure 6 " equity participation " relation).Thus, it is possible to show final relation on the intended display interface
Collection of illustrative plates.
For example, using first object node as A, exemplified by the second destination node is B, relation map according to embodiments of the present invention
Methods of exhibiting can obtain a final relation map, and the bandwagon effect of the relation map can be as shown in Figure 6.It can see
Go out, relation map as shown in Figure 6 can more conform to the shape and size at current goal displaying interface, be easy to user to check.
The methods of exhibiting of relation map according to embodiments of the present invention, first object node and at least one second can be obtained
Path list between destination node, the path list may include n access path, have m association in the n access path
Node, and the access path for having common points in n access path is adjusted to adjacent position, and similar access path is adjusted
It is whole to arrive adjacent position, with n access path after being updated；Afterwards, for each access path after renewal, according to target
The dimension information at displaying interface calculates the coordinate of each associated nodes included in each access path respectively；Then, by n
The coordinate of each common points in access path merges respectively, and using the coordinate after merging as each common points
Final coordinate；Finally, associated nodes are plotted on intended display interface according to the coordinate being calculated, and draw line to obtain
To final relation map.So, relation map effectively distribution node can be enabled corresponding on intended display interface
Position, clean and tidy clearly bandwagon effect (as without situation about intersecting) can be not only formed, and can efficiently utilize target
Interface is shown, improves Consumer's Experience.
Corresponding with the methods of exhibiting for the relation map that above-mentioned several embodiments provide, a kind of embodiment of the invention also carries
For a kind of exhibiting device of relation map, due to exhibiting device and the above-mentioned several realities of relation map provided in an embodiment of the present invention
It is corresponding to apply the methods of exhibiting of the relation map of example offer, therefore the embodiment of the methods of exhibiting in forgoing relationship collection of illustrative plates is also fitted
The exhibiting device of the relation map provided for the present embodiment, is not described in detail in the present embodiment.Fig. 7 is according to the present invention
The structural representation of the exhibiting device of the relation map of one embodiment.As shown in fig. 7, the exhibiting device of the relation map can be with
Including：Acquisition module 710, the first order module 720, the second order module 730, computing module 740, coordinate merging module 750
With display module 760.
Specifically, acquisition module 710 is used to obtain the road between first object node and at least one second destination node
Footpath list, wherein, path list may include n access path, have m associated nodes in n access path, wherein, m pass
Interlink point may include first object node, at least one second destination node and other associated nodes, and n is positive integer, m be more than
2 positive integer.
First order module 720 is used to carry out a minor sort to N number of access path according to the frequency that node occurs；As one
Kind example, the first order module 720 can be specifically used for：S11, according to the number of access path where associated nodes, m is associated
Node is ranked up, the node listing after being sorted；S12, i-th of associated nodes is chosen from node listing, from path column
The access path where i-th of associated nodes is moved to the starting position of path list to update path list in table, wherein,
1≤i≤m；S13, based on the path list after renewal, step S12 and S13 are repeated, until being connected where in node listing
Untill associated nodes of the number in path more than 1 have been selected.
Second order module 730 is used to carry out two minor sorts to n access path according to the similarity of access path.As
A kind of example, the second order module 730 can be specifically used for：S21, j-th of company is chosen from n access path after a minor sort
Path is connect, from the n access path acquisition after a minor sort and j-th of access path similarity highest access path, wherein,
1≤j≤n；S22, will be with j-th of access path similarity highest access path, next connection with j-th of access path
Path carries out place-exchange；S23, since next access path of j-th of access path, step S21-S23 is repeated,
Until n access path after a minor sort is all selected.
Computing module 740 is used to be directed to each access path after two minor sorts, is believed according to the size at intended display interface
Breath calculates the coordinate of each associated nodes included in each access path respectively.As a kind of example, as shown in figure 8, should
Computing module 740 can include：Acquiring unit 741, the first computing unit 742, the second computing unit 743, the 3rd computing unit
744 and the 4th computing unit 745.
Wherein, acquiring unit 741 is used for the dimension information for obtaining intended display interface.First computing unit 742 is used for will
Intended display interface is partitioned into L*K grid, and the width value and height value of each grid are calculated according to dimension information, its
In, L is the length value of longest path in n access path, and K is the number of access path.
Second computing unit 743 is used to be directed to each access path after two minor sorts, according to the first preset formula and width
Angle value calculates the abscissa of all associated nodes in each access path.Wherein, in an embodiment of the present invention, this is first default
Formula can be：
X=grid_w* (i+1/2)
Wherein, x is abscissa, and grid_w is width value, and i is i-th of access path after two minor sorts.
3rd computing unit 744 is used to, according to the second preset formula and height value, calculate and associate section in each access path
Minimum interval between point.Wherein, in an embodiment of the present invention, second preset formula is：
Grid_1h'=int (grid_1h/grid_h) * grid_h
Wherein, grid_1h' is minimum interval；Grid_1h=float (height)/n, wherein, float () is floating type
Data type, height are the height at intended display interface, and n is the number of the associated nodes included in each access path；
Grid_h is height value；Int () is downward bracket function.That is, can be first according to formula grid_1h=float
(height)/n calculates the minimum interval between associated nodes in current access path, then utilizes formula grid_1h'=int
(grid_1h/grid_h) * grid_h) correct, obtain final minimum interval.
4th computing unit 745 be used for be directed to each access path in each associated nodes, according to the 3rd preset formula,
Height value and minimum interval, calculate the ordinate of each associated nodes.Wherein, in an embodiment of the present invention, the 3rd is default
Formula is：
Y=int (grid_h/2+j*grid_1h')
Wherein, y is ordinate, and int () is downward bracket function, and grid_h is height value, and j is in each access path
J-th of associated nodes, grid_1h' are minimum interval.
Coordinate merging module 750 is used to respectively merge the coordinate of each common points in n access path, and
Final coordinate using the coordinate after merging as each common points.As a kind of example, can be directed in n access path
Each common points, the abscissa in multiple coordinates of each common points is subjected to size sequence, and by ranking results
Median as each common points merge after abscissa；It is determined that ordinate in multiple coordinates of each common points
Maximum, and using maximum as the ordinate after the merging of each common points.Merge thus, it is possible to obtain each common points
Coordinate afterwards.
Display module 760 is used to m associated nodes are plotted in into intended display interface according to coordinate, while according to mutual
The m associated nodes that relation would be mapped out on intended display interface carry out line.
The exhibiting device of relation map according to embodiments of the present invention, first object node and at least one second can be obtained
Path list between destination node, the path list may include n access path, have m association in the n access path
Node, and the access path for having common points in n access path is adjusted to adjacent position, and similar access path is adjusted
It is whole to arrive adjacent position, with n access path after being updated；Afterwards, for each access path after renewal, according to target
The dimension information at displaying interface calculates the coordinate of each associated nodes included in each access path respectively；Then, by n
The coordinate of each common points in access path merges respectively, and using the coordinate after merging as each common points
Final coordinate；Finally, associated nodes are plotted on intended display interface according to the coordinate being calculated, and draw line to obtain
To final relation map.So, relation map effectively distribution node can be enabled corresponding on intended display interface
Position, clean and tidy clearly bandwagon effect (as without situation about intersecting) can be not only formed, and can efficiently utilize target
Interface is shown, improves Consumer's Experience.
In order to realize above-described embodiment, the invention also provides a kind of terminal device.
Fig. 9 is the structural representation of terminal device according to an embodiment of the invention.As shown in figure 9, the terminal device
900 may include memory 910, processor 920 and be stored in the computer that can be run on memory 910 and on processor 920
Program 930, when processor 920 performs described program 930, described in realization any one embodiment of the invention is the displaying side of collection of illustrative plates
Method.
In order to realize above-described embodiment, the invention also provides a kind of non-transitorycomputer readable storage medium, thereon
Computer program is stored with, relation map when described program is executed by processor described in realization any one embodiment of the invention
Methods of exhibiting.
In the description of the invention, it is to be understood that term " first ", " second " are only used for describing purpose, and can not
It is interpreted as indicating or implies relative importance or imply the quantity of the technical characteristic indicated by indicating.Thus, define " the
One ", at least one this feature can be expressed or be implicitly included to the feature of " second ".In the description of the invention, " multiple "
It is meant that at least two, such as two, three etc., unless otherwise specifically defined.
In the description of this specification, reference term " one embodiment ", " some embodiments ", " example ", " specifically show
The description of example " or " some examples " etc. means specific features, structure, material or the spy for combining the embodiment or example description
Point is contained at least one embodiment or example of the present invention.In this manual, to the schematic representation of above-mentioned term not
Identical embodiment or example must be directed to.Moreover, specific features, structure, material or the feature of description can be with office
Combined in an appropriate manner in one or more embodiments or example.In addition, in the case of not conflicting, the skill of this area
Art personnel can be tied the different embodiments or example and the feature of different embodiments or example described in this specification
Close and combine.
Any process or method described otherwise above description in flow chart or herein is construed as, and represents to include
Module, fragment or the portion of the code of the executable instruction of one or more the step of being used to realize specific logical function or process
Point, and the scope of the preferred embodiment of the present invention includes other realization, wherein can not press shown or discuss suitable
Sequence, including according to involved function by it is basic simultaneously in the way of or in the opposite order, carry out perform function, this should be of the invention
Embodiment person of ordinary skill in the field understood.
Expression or logic and/or step described otherwise above herein in flow charts, for example, being considered use
In the order list for the executable instruction for realizing logic function, may be embodied in any computer-readable medium, for
Instruction execution system, device or equipment (such as computer based system including the system of processor or other can be held from instruction
The system of row system, device or equipment instruction fetch and execute instruction) use, or combine these instruction execution systems, device or set
It is standby and use.For the purpose of this specification, " computer-readable medium " can any can be included, store, communicate, propagate or pass
Defeated program is for instruction execution system, device or equipment or the dress used with reference to these instruction execution systems, device or equipment
Put.The more specifically example (non-exhaustive list) of computer-readable medium includes following：Electricity with one or more wiring
Connecting portion (electronic installation), portable computer diskette box (magnetic device), random access memory (RAM), read-only storage
(ROM), erasable edit read-only storage (EPROM or flash memory), fiber device, and portable optic disk is read-only deposits
Reservoir (CDROM).In addition, computer-readable medium, which can even is that, to print the paper of described program thereon or other are suitable
Medium, because can then enter edlin, interpretation or if necessary with it for example by carrying out optical scanner to paper or other media
His suitable method is handled electronically to obtain described program, is then stored in computer storage.
It should be appreciated that each several part of the present invention can be realized with hardware, software, firmware or combinations thereof.Above-mentioned
In embodiment, software that multiple steps or method can be performed in memory and by suitable instruction execution system with storage
Or firmware is realized.If, and in another embodiment, can be with well known in the art for example, realized with hardware
Any one of row technology or their combination are realized：With the logic gates for realizing logic function to data-signal
Discrete logic, have suitable combinational logic gate circuit application specific integrated circuit, programmable gate array (PGA), scene
Programmable gate array (FPGA) etc..
Those skilled in the art are appreciated that to realize all or part of step that above-described embodiment method carries
Suddenly it is that by program the hardware of correlation can be instructed to complete, described program can be stored in a kind of computer-readable storage medium
In matter, the program upon execution, including one or a combination set of the step of embodiment of the method.
In addition, each functional unit in each embodiment of the present invention can be integrated in a processing module, can also
That unit is individually physically present, can also two or more units be integrated in a module.Above-mentioned integrated mould
Block can both be realized in the form of hardware, can also be realized in the form of software function module.The integrated module is such as
Fruit is realized in the form of software function module and as independent production marketing or in use, can also be stored in a computer
In read/write memory medium.
Storage medium mentioned above can be read-only storage, disk or CD etc..Although have been shown and retouch above
Embodiments of the invention are stated, it is to be understood that above-described embodiment is exemplary, it is impossible to be interpreted as the limit to the present invention
System, one of ordinary skill in the art can be changed to above-described embodiment, change, replace and become within the scope of the invention
Type.
Claims (10)
1. a kind of methods of exhibiting of relation map, it is characterised in that comprise the following steps：
The path list between first object node and at least one second destination node is obtained, wherein, the path list can
Including n access path, there are m associated nodes in the n access path, wherein, the m associated nodes may include institute
First object node, at least one second destination node and other associated nodes are stated, n is positive integer, and m is more than 2 just
Integer；
One minor sort is carried out to the n access path according to the frequency that node occurs, and according to the similarity pair of access path
The n access path carries out two minor sorts；
For each access path after two minor sorts, calculated and described each connected respectively according to the dimension information at intended display interface
Connect the coordinate of each associated nodes included in path；
The coordinate of each common points in the n access path is merged respectively, and using the coordinate after merging as
The final coordinate of each common points；And
The m associated nodes are plotted on the intended display interface according to the coordinate being calculated, while according to described
The m associated nodes being plotted on the intended display interface are carried out line by access path.
2. the methods of exhibiting of relation map as claimed in claim 1, it is characterised in that the frequency pair occurred according to node
The n access path carries out a minor sort, including：
S11, according to the number of access path where associated nodes, the m associated nodes are ranked up, after being sorted
Node listing；
S12, i-th of associated nodes is chosen from the node listing, by i-th of associated nodes from the path list
The access path at place is moved to the starting position of the path list to update the path list, wherein, 1≤i≤m；
S13, based on the path list after the renewal, the step S12 and S13 is repeated, until in the node listing
Untill associated nodes of the number of the place access path more than 1 have been selected.
3. the methods of exhibiting of relation map as claimed in claim 1, it is characterised in that the similarity according to access path
Two minor sorts are carried out to the n access path, including：
S21, j-th of access path is chosen from n access path after a minor sort, the n after a minor sort
Individual access path obtains and j-th of access path similarity highest access path, wherein, 1≤j≤n；
S22, by under described and j-th of access path similarity highest access path, with j-th of access path
One access path carries out place-exchange；
S23, since next access path of j-th of access path, the step S21-S23 is repeated, until
N access path after one minor sort is all selected.
4. the methods of exhibiting of relation map as claimed in claim 1, it is characterised in that it is described be directed to it is each after two minor sorts
Access path, each association included in each access path is calculated according to the dimension information at intended display interface respectively
The coordinate of node, including：
Obtain the dimension information at intended display interface；
The intended display interface is partitioned into L*K grid, and the width of each grid is calculated according to the dimension information
Value and height value, wherein, L is the length value of longest path in the n access path, and K is the number of the access path；
For each access path after two minor sort, calculated according to the first preset formula and the width value described each
The abscissa of all associated nodes in access path；
According to the second preset formula and the height value, between the minimum in calculating each access path between associated nodes
Every；
For each associated nodes in each access path, according to the 3rd preset formula, the height value and it is described most
It is closely-spaced, calculate the ordinate of each associated nodes.
5. the methods of exhibiting of relation map as claimed in claim 4, it is characterised in that
First preset formula is：
X=grid_w* (i+1/2)
Wherein, x is the abscissa, and grid_w is the width value, and i is i-th of access path after two minor sort；
Second preset formula is：
Grid_1h'=int (grid_1h/grid_h) * grid_h
Wherein, grid_1h' is the minimum interval；Grid_1h=float (height)/n, wherein, float () is floating type
Data type, height are the height at the intended display interface, and n is of the associated nodes included in each access path
Number；Grid_h is the height value；Int () is downward bracket function；
3rd preset formula is：
Y=int (grid_h/2+j*grid_1h')
Wherein, y is the ordinate of j-th of associated nodes, and int () is downward bracket function, and grid_h is the height value,
J is j-th of associated nodes in each access path, and grid_1h' is the minimum interval.
6. the methods of exhibiting of relation map as claimed in claim 1, it is characterised in that it is described will be each in n access path
The coordinate of individual common points merges respectively, including：
For each common points in the n access path, by the horizontal seat in multiple coordinates of each common points
Mark carries out size sequence, and using the median in ranking results as the abscissa after each common points merging；
The maximum of the ordinate in multiple coordinates of each common points is determined, and using the maximum as described every
Ordinate after individual common points merging.
A kind of 7. exhibiting device of relation map, it is characterised in that including：
Acquisition module, for obtaining the path list between first object node and at least one second destination node, wherein, institute
Stating path list may include n access path, have m associated nodes in the n access path, wherein, the m association
Node may include the first object node, at least one second destination node and other associated nodes, and n is positive integer, m
For the positive integer more than 2；
First order module, for carrying out a minor sort to the n access path according to the frequency that node occurs；
Second order module, two minor sorts are carried out to the n access path for the similarity according to access path；
Computing module, for for each access path after two minor sorts, being distinguished according to the dimension information at intended display interface
Calculate the coordinate of each associated nodes included in each access path；
Coordinate merging module, for the coordinate of each common points in the n access path to be merged respectively, and will
Final coordinate of the coordinate as each common points after merging；
Display module, for the m associated nodes to be plotted in into the intended display interface according to the coordinate being calculated,
The m associated nodes being plotted on the intended display interface are carried out by line according to the access path simultaneously.
8. the exhibiting device of relation map as claimed in claim 7, it is characterised in that first order module is specifically used
In：
S11, according to the number of access path where associated nodes, the m associated nodes are ranked up, after being sorted
Node listing；
S12, i-th of associated nodes is chosen from the node listing, by i-th of associated nodes from the path list
The access path at place is moved to the starting position of the path list to update the path list, wherein, 1≤i≤m；
S13, based on the path list after the renewal, the step S12 and S13 is repeated, until in the node listing
Untill associated nodes of the number of the place access path more than 1 have been selected.
9. the exhibiting device of relation map as claimed in claim 7, it is characterised in that second order module is specifically used
In：
S21, j-th of access path is chosen from n access path after a minor sort, the n after a minor sort
Individual access path obtains and j-th of access path similarity highest access path, wherein, 1≤j≤n；
S22, by under described and j-th of access path similarity highest access path, with j-th of access path
One access path carries out place-exchange；
S23, since next access path of j-th of access path, the step S21-S23 is repeated, until
N access path after one minor sort is all selected.
10. the exhibiting device of relation map as claimed in claim 7, it is characterised in that the computing module includes：
Acquiring unit, for obtaining the dimension information at intended display interface；
First computing unit, for the intended display interface to be partitioned into L*K grid, and according to the dimension information meter
The width value and height value of each grid are calculated, wherein, L is the length value of longest path in the n access path, and K is described
The number of access path；
Second computing unit, for for each access path after two minor sort, according to the first preset formula and described
Width value calculates the abscissa of all associated nodes in each access path；
3rd computing unit, for according to the second preset formula and the height value, calculating and being associated in each access path
Minimum interval between node；
4th computing unit, for for each associated nodes in each access path, according to the 3rd preset formula, institute
Height value and the minimum interval are stated, calculates the ordinate of each associated nodes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710497163.9A CN107357846B (en) | 2017-06-26 | 2017-06-26 | The methods of exhibiting and device of relation map |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710497163.9A CN107357846B (en) | 2017-06-26 | 2017-06-26 | The methods of exhibiting and device of relation map |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107357846A true CN107357846A (en) | 2017-11-17 |
| CN107357846B CN107357846B (en) | 2018-12-14 |
Family
ID=60273057
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710497163.9A Active CN107357846B (en) | 2017-06-26 | 2017-06-26 | The methods of exhibiting and device of relation map |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107357846B (en) |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108921914A (en) * | 2018-05-25 | 2018-11-30 | 北京石油化工学院 | A kind of pedigree drawing drawing method, device and electronic equipment |
| CN109165322A (en) * | 2018-08-01 | 2019-01-08 | 成都数联铭品科技有限公司 | Network characterization extraction system and method based on path relation |
| CN109597856A (en) * | 2018-12-05 | 2019-04-09 | 北京知道创宇信息技术有限公司 | A kind of data processing method, device, electronic equipment and storage medium |
| CN109739859A (en) * | 2018-12-29 | 2019-05-10 | 深圳证券信息有限公司 | A kind of relation map method for drafting, system and relevant apparatus |
| CN111046112A (en) * | 2019-11-22 | 2020-04-21 | 精硕科技（北京）股份有限公司 | Method and device for displaying class knowledge graph and electronic equipment |
| CN111597275A (en) * | 2019-02-21 | 2020-08-28 | 阿里巴巴集团控股有限公司 | Method and device for processing isomorphic subgraph or topological graph |
| CN111708847A (en) * | 2020-05-20 | 2020-09-25 | 北京明略软件系统有限公司 | Method and device for displaying relation graph |
| CN111831863A (en) * | 2020-07-17 | 2020-10-27 | 浙江大华技术股份有限公司 | Data visualization method and device and computer-readable storage medium |
| CN112437919A (en) * | 2018-06-28 | 2021-03-02 | 麦格纳维尤有限公司 | Steady graph layout determination |
| CN112632194A (en) * | 2020-12-30 | 2021-04-09 | 平安证券股份有限公司 | Data graphic visualization relation representation method, device, equipment and storage medium |
| CN113391736A (en) * | 2020-12-02 | 2021-09-14 | 腾讯科技（深圳）有限公司 | Method and device for determining object connection line, storage medium and electronic equipment |
| CN113448667A (en) * | 2021-06-09 | 2021-09-28 | 绿盟科技集团股份有限公司 | Method and device for generating display relation graph |
| CN113449128A (en) * | 2021-06-29 | 2021-09-28 | 平安资产管理有限责任公司 | Picture generation method and related device for displaying key stock right structure |
| CN115238133A (en) * | 2022-07-01 | 2022-10-25 | 盐城金堤科技有限公司 | Map layout method and device, storage medium and electronic equipment |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060106792A1 (en) * | 2004-07-26 | 2006-05-18 | Patterson Anna L | Multiple index based information retrieval system |
| CN103425741A (en) * | 2013-07-16 | 2013-12-04 | 北京中科汇联信息技术有限公司 | Information exhibiting method and device |
| CN103699645A (en) * | 2013-12-26 | 2014-04-02 | 中国人民银行征信中心 | System and method for identifying association relations among enterprises |
| CN105488130A (en) * | 2015-11-25 | 2016-04-13 | 成都数联铭品科技有限公司 | Associated data visualization display method |
| CN106294481A (en) * | 2015-06-05 | 2017-01-04 | 阿里巴巴集团控股有限公司 | A kind of air navigation aid based on collection of illustrative plates and device |
-
2017
- 2017-06-26 CN CN201710497163.9A patent/CN107357846B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060106792A1 (en) * | 2004-07-26 | 2006-05-18 | Patterson Anna L | Multiple index based information retrieval system |
| CN103425741A (en) * | 2013-07-16 | 2013-12-04 | 北京中科汇联信息技术有限公司 | Information exhibiting method and device |
| CN103699645A (en) * | 2013-12-26 | 2014-04-02 | 中国人民银行征信中心 | System and method for identifying association relations among enterprises |
| CN106294481A (en) * | 2015-06-05 | 2017-01-04 | 阿里巴巴集团控股有限公司 | A kind of air navigation aid based on collection of illustrative plates and device |
| CN105488130A (en) * | 2015-11-25 | 2016-04-13 | 成都数联铭品科技有限公司 | Associated data visualization display method |
Cited By (23)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108921914B (en) * | 2018-05-25 | 2022-10-28 | 北京石油化工学院 | Method and device for drawing spectrum and electronic equipment |
| CN108921914A (en) * | 2018-05-25 | 2018-11-30 | 北京石油化工学院 | A kind of pedigree drawing drawing method, device and electronic equipment |
| CN112437919A (en) * | 2018-06-28 | 2021-03-02 | 麦格纳维尤有限公司 | Steady graph layout determination |
| CN109165322A (en) * | 2018-08-01 | 2019-01-08 | 成都数联铭品科技有限公司 | Network characterization extraction system and method based on path relation |
| CN109165322B (en) * | 2018-08-01 | 2022-04-19 | 成都数联铭品科技有限公司 | Network feature extraction system and method based on path relation |
| CN109597856A (en) * | 2018-12-05 | 2019-04-09 | 北京知道创宇信息技术有限公司 | A kind of data processing method, device, electronic equipment and storage medium |
| CN109597856B (en) * | 2018-12-05 | 2020-12-25 | 北京知道创宇信息技术股份有限公司 | Data processing method and device, electronic equipment and storage medium |
| CN109739859A (en) * | 2018-12-29 | 2019-05-10 | 深圳证券信息有限公司 | A kind of relation map method for drafting, system and relevant apparatus |
| CN109739859B (en) * | 2018-12-29 | 2022-08-30 | 深圳证券信息有限公司 | Relation map drawing method, system and related device |
| CN111597275A (en) * | 2019-02-21 | 2020-08-28 | 阿里巴巴集团控股有限公司 | Method and device for processing isomorphic subgraph or topological graph |
| CN111597275B (en) * | 2019-02-21 | 2023-06-20 | 阿里巴巴集团控股有限公司 | Isomorphic subgraph or topological graph processing method and device |
| CN111046112A (en) * | 2019-11-22 | 2020-04-21 | 精硕科技（北京）股份有限公司 | Method and device for displaying class knowledge graph and electronic equipment |
| CN111708847A (en) * | 2020-05-20 | 2020-09-25 | 北京明略软件系统有限公司 | Method and device for displaying relation graph |
| CN111831863A (en) * | 2020-07-17 | 2020-10-27 | 浙江大华技术股份有限公司 | Data visualization method and device and computer-readable storage medium |
| CN113391736A (en) * | 2020-12-02 | 2021-09-14 | 腾讯科技（深圳）有限公司 | Method and device for determining object connection line, storage medium and electronic equipment |
| CN113391736B (en) * | 2020-12-02 | 2023-04-07 | 腾讯科技（深圳）有限公司 | Method and device for determining object connection line, storage medium and electronic equipment |
| CN112632194A (en) * | 2020-12-30 | 2021-04-09 | 平安证券股份有限公司 | Data graphic visualization relation representation method, device, equipment and storage medium |
| CN112632194B (en) * | 2020-12-30 | 2023-11-03 | 平安证券股份有限公司 | Method, device, equipment and storage medium for representing graphic visualization relationship of data |
| CN113448667B (en) * | 2021-06-09 | 2023-08-01 | 绿盟科技集团股份有限公司 | Method and device for generating display relationship diagram |
| CN113448667A (en) * | 2021-06-09 | 2021-09-28 | 绿盟科技集团股份有限公司 | Method and device for generating display relation graph |
| CN113449128A (en) * | 2021-06-29 | 2021-09-28 | 平安资产管理有限责任公司 | Picture generation method and related device for displaying key stock right structure |
| CN113449128B (en) * | 2021-06-29 | 2024-04-05 | 平安资产管理有限责任公司 | Picture generation method and related device for displaying key equity structure |
| CN115238133A (en) * | 2022-07-01 | 2022-10-25 | 盐城金堤科技有限公司 | Map layout method and device, storage medium and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107357846B (en) | 2018-12-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107357846A (en) | The methods of exhibiting and device of relation map | |
| US9098591B2 (en) | Spatio-temporal data management system, spatio-temporal data management method, and machine-readable storage medium thereof | |
| CN104361113B (en) | A kind of OLAP query optimization method under internal memory flash memory mixing memory module | |
| CN109299685A (en) | Deduction network and its method for the estimation of human synovial 3D coordinate | |
| CN105989076A (en) | Data statistical method and device | |
| CN105976048A (en) | Power transmission network extension planning method based on improved artificial bee colony algorithm | |
| CN102682046A (en) | Member searching and analyzing method in social network and searching system | |
| CN105654201A (en) | Advertisement flow prediction method and device | |
| CN106844089A (en) | A kind of method and apparatus for recovering tree data storage | |
| Jiang et al. | Identifying K Primary Corridors from urban bicycle GPS trajectories on a road network | |
| CN104142962A (en) | Method for processing chain elements of electronic map | |
| CN102375827A (en) | Method for fast loading versioned electricity network model database | |
| CN110472797A (en) | A kind of city bus complex network automatic generating method based on web | |
| Wang et al. | A fast candidate viewpoints filtering algorithm for multiple viewshed site planning | |
| CN108898244B (en) | Digital signage position recommendation method coupled with multi-source elements | |
| CN108038734B (en) | Urban commercial facility spatial distribution detection method and system based on comment data | |
| CN114822033B (en) | Road network traffic flow data restoration method and system based on feature pyramid network | |
| CN116993555A (en) | Partition method, system and storage medium for identifying territory space planning key region | |
| Fang et al. | Mining co-location patterns with dominant features | |
| US8612183B2 (en) | Analysis model generation system | |
| KR101955376B1 (en) | Processing method for a relational query in distributed stream processing engine based on shared-nothing architecture, recording medium and device for performing the method | |
| CN108563794A (en) | Context based on Higher-order Singular value decomposition recommends method and device | |
| CN104156618B (en) | Economic data automatic analysis system based on map | |
| CN103207915A (en) | Reverse skyline query method, device and system | |
| CN106055690A (en) | Method for carrying out rapid retrieval and acquiring data features on basis of attribute matching |
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 |