# US 2021/0334278 A1 · Method and apparatus for mining competition relationship pois

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2021/0334278 A1
- Document ID: US20210334278A1
- Status: Published application
- Kind: A1
- Application number: 17/110,144
- Filed: 2020-12-02
- Published: 2021-10-28
- Earliest claimed: 2020-04-22
- Assignees: Beijing Baidu Netcom Science Technology Co., Ltd.
- Applicants: Beijing Baidu Netcom Science and Technology Co., Ltd.
- Inventors: Jingbo ZHOU; Hui XIONG
- Web page: https://patentgrep.com/patent/US20210334278A1

## CPC

- G06F 16/2465: {Query processing support for facilitating data mining operations in structured databases}
- G06F 16/288: {Entity relationship models}
- G06F 16/29: Geographical information databases
- G06F 16/9024: {Graphs; Linked lists (G06F16/9027 takes precedence)}
- G06N 3/04: Architecture, e.g. interconnection topology
- G06N 3/0464: Convolutional networks [CNN, ConvNet]
- G06N 3/08: Learning methods
- G06N 3/09: Supervised learning
- G06N 5/022: Knowledge engineering; Knowledge acquisition
- G06F 2216/03: Data mining
- Y02D 10/00: Energy efficient computing, e.g. low power processors, power management or thermal management
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- Y02D: CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE

## Abstract

A method and apparatus for mining a competition relationship between POIs. An embodiment of the method includes: acquiring a graphlet mining result obtained by mining map retrieval data of users which comprises attribute information of retrieved target POIs, the graphlet mining result comprising occurrence frequencies of respective preset situations, and a preset situation comprising: conforming to attribute information of POIs represented by a corresponding preset graphlet and a preset association relationship between attribute information of at least two POIs; for a first and second POI, determining an occurrence frequency of a preset situation corresponding to a preset graphlet where attribute information of the first and second POI co-occur, and generating a relationship feature of the first and second POI; and inputting the relationship feature into a pre-trained relationship prediction model to obtain a competition relationship prediction result of the first POI and the second POI.

## Claims

### Claim 1

A method for mining a competition relationship between points of interest (POIs), the method comprising:
acquiring a graphlet mining result obtained by mining map retrieval data of users, the map retrieval data comprising attribute information of retrieved target POIs, the graphlet mining result comprising occurrence frequencies of respective preset situations, and a preset situation comprising: conforming to attribute information of POIs represented by a corresponding preset graphlet and a preset association relationship between attribute information of at least two POIs represented by the corresponding preset graphlet;
for a first POI and a second POI between which a competition relationship is to be determined, determining, based on the graphlet mining result, an occurrence frequency of a preset situation corresponding to a preset graphlet where attribute information of the first POI and attribute information of the second POI co-occur, and generating a relationship feature of the first POI and the second POI based on the determined occurrence frequency of the preset situation corresponding to the preset graphlet where the attribute information of the first POI and the attribute information of the second POI co-occur; and
inputting the relationship feature of the first POI and the second POI into a pre-trained relationship prediction model to obtain a competition relationship prediction result of the first POI and the second POI.

### Claim 2 (depends on 1)

The method according to claim 1, wherein the method further comprises:
acquiring the map retrieval data of the users, wherein the map retrieval data comprises time information when the users retrieve the target POIs;
constructing, based on associations between time information of different target POIs retrieved by same users, a POIs connection relationship graph representing relationships between target POIs; and
counting, on the basis of the POIs connection relationship graph, occurrence frequencies of preset situations corresponding to respective preset graphlets, to obtain the graphlet mining result.

### Claim 3 (depends on 2)

The method according to claim 2, wherein the preset graphlet comprises:
at least one first preset graphlet, the first preset graphlet representing attribute information of a pair of associated POIs and an association relationship between the attribute information of the pair of POIs and attribute information of at least one neighboring POI.

### Claim 4 (depends on 3)

The method according to claim 3, wherein the preset graphlet further comprises:
at least one second preset graphlet, the second preset graphlet representing a pair of associated POIs and an association relationship between the pair of POIs and at least one neighboring POI; and
the counting, on the basis of the POIs connection relationship graph, the occurrence frequencies of the preset situations corresponding to the respective preset graphlets, comprises:
respectively counting, based on the POIs connection relationship graph, frequencies of that the relationships between the target POIs conform to preset situations corresponding to respective second preset graphlets, to obtain counting results; and
for each first preset graphlet, respectively counting, based on attribute information of POIs in the second preset graphlets and the counting results of the frequencies of that the relationships between the target POIs respectively conform to the preset situations corresponding to the second preset graphlets, a frequency of that the attribute information of the target POIs and a relationship between the attribute information of the target POIs both conform to a preset situation corresponding to the first preset graphlet.

### Claim 5 (depends on 4)

The method according to claim 4, wherein the preset graphlet further comprises:
at least one third preset graphlet, the third preset graphlet comprising a pair of nodes and a neighboring node connected to at least one node in the pair of nodes, and node connection relationships in different third preset graphlets are different from each other;
the counting, on the basis of the POIs connection relationship graph, the occurrence frequencies of the preset situations corresponding to the respective preset graphlets, further comprises:
counting a frequency of situations that conform to a graph structure of each third preset graphlet, based on counting results of frequencies of that the attribute information of the target POIs and the relationships between the attribute information of the target POIs both conform to the preset situations corresponding to the first preset graphlets.

### Claim 6 (depends on 1)

The method according to claim 1, wherein the determining, based on the graphlet mining result, the occurrence frequency of the preset situation corresponding to the preset graphlet where the attribute information of the first POI and the attribute information of the second POI co-occur, and generating the relationship feature of the first POI and the second POI based on the determined occurrence frequency of the preset situation corresponding to the preset graphlet where the attribute information of the first POI and the attribute information of the second POI co-occur, comprises:
acquiring a first sorting list of the occurrence frequencies of respective preset situations, and a second sorting list of a preset number of hot preset situations ranked top in the first sorting list;
generating a first relationship feature of the first POI and the second POI, based on a ranking position of each preset graphlet, where the attribute information of the first POI and the attribute information of the second POI co-occur, in the first sorting list and occurrence frequencies of corresponding preset situations; and
generating a second relationship feature of the first POI and the second POI, based on a ranking position of each preset graphlet, where the attribute information of the first POI and the attribute information of the second POI co-occur, in the second sorting list and occurrence frequencies of corresponding preset situations.

### Claim 7 (depends on 6)

The method according to claim 6, wherein the method further comprises:
generating a joint attribute feature of the first POI and the second POI based on the attribute information of the first POI and the attribute information of the second POI;
the pre-trained relationship prediction model comprises: a self-attention module and a cross-attention module; and
the self-attention module processes the second relationship feature based on a preset self-attention mechanism, and the cross-attention module processes the joint attribute feature and the second relationship feature based on a preset cross-attention mechanism.

### Claim 8 (depends on 7)

The method according to claim 7, wherein the pre-trained relationship prediction model further comprises: a multi-layer perceptron; and
the multi-layer perceptron is configured to predict a competition relationship between the first POI and the second POI, based on the first relationship feature corresponding to preset graphlets, a feature output by the self-attention module, and a feature output by the cross-attention module.

### Claim 9 (depends on 1)

The method according to claim 1, wherein the method further comprises:
configuring a service resource related to the first POI based on the competition relationships between the first POI and at least two second POIs.

### Claim 10

An electronic device, comprising:
at least one processor; and
a memory, communicatively connected to the at least one processor; wherein,
the memory, storing instructions executable by the at least one processor, the instructions, when executed by the at least one processor, cause the at least one processor to perform operations, the operations comprise:
acquiring a graphlet mining result obtained by mining map retrieval data of users, the map retrieval data comprising attribute information of retrieved target POIs, the graphlet mining result comprising occurrence frequencies of respective preset situations, and a preset situation comprising: conforming to attribute information of POIs represented by a corresponding preset graphlet and a preset association relationship between attribute information of at least two POIs represented by the corresponding preset graphlet;
for a first POI and a second POI between which a competition relationship is to be determined, determining, based on the graphlet mining result, an occurrence frequency of a preset situation corresponding to a preset graphlet where attribute information of the first POI and attribute information of the second POI co-occur, and generating a relationship feature of the first POI and the second POI based on the determined occurrence frequency of the preset situation corresponding to the preset graphlet where the attribute information of the first POI and the attribute information of the second POI co-occur; and
inputting the relationship feature of the first POI and the second POI into a pre-trained relationship prediction model to obtain a competition relationship prediction result of the first POI and the second POI.

### Claim 11 (depends on 10)

The device according to claim 10, wherein the operations further comprise:
acquiring the map retrieval data of the users, wherein the map retrieval data comprises time information when the users retrieve the target POIs;
constructing, based on associations between time information of different target POIs retrieved by same users, a POIs connection relationship graph representing relationships between target POIs; and
counting, on the basis of the POIs connection relationship graph, occurrence frequencies of preset situations corresponding to respective preset graphlets, to obtain the graphlet mining result.

### Claim 12 (depends on 11)

The device according to claim 11, wherein the preset graphlet comprises:
at least one first preset graphlet, the first preset graphlet representing attribute information of a pair of associated POIs and an association relationship between the attribute information of the pair of POIs and attribute information of at least one neighboring POI.

### Claim 13 (depends on 12)

The device according to claim 12, wherein the the preset graphlet further comprises:
at least one second preset graphlet, the second preset graphlet representing a pair of associated POIs and an association relationship between the pair of POIs and at least one neighboring POI; and
the counting, on the basis of the POIs connection relationship graph, the occurrence frequencies of the preset situations corresponding to the respective preset graphlets, comprises:
respectively counting, based on the POIs connection relationship graph, frequencies of that the relationships between the target POIs conform to preset situations corresponding to respective second preset graphlets, to obtain counting results; and
for each first preset graphlet, respectively counting, based on attribute information of POIs in the second preset graphlets and the counting results of the frequencies of that the relationships between the target POIs respectively conform to the preset situations corresponding to the second preset graphlets, a frequency of that the attribute information of the target POIs and a relationship between the attribute information of the target POIs both conform to a preset situation corresponding to the first preset graphlet.

### Claim 14 (depends on 13)

The device according to claim 13, wherein the preset graphlet further comprises:
at least one third preset graphlet, the third preset graphlet comprising a pair of nodes and a neighboring node connected to at least one node in the pair of nodes, and node connection relationships in different third preset graphlets are different from each other;
the counting, on the basis of the POIs connection relationship graph, the occurrence frequencies of the preset situations corresponding to the respective preset graphlets, further comprises:
counting a frequency of situations that conform to a graph structure of each third preset graphlet, based on counting results of frequencies of that the attribute information of the target POIs and the relationships between the attribute information of the target POIs both conform to the preset situations corresponding to the first preset graphlets.

### Claim 15 (depends on 10)

The device according to claim 10, wherein the determining, based on the graphlet mining result, the occurrence frequency of the preset situation corresponding to the preset graphlet where the attribute information of the first POI and the attribute information of the second POI co-occur, and generating the relationship feature of the first POI and the second POI based on the determined occurrence frequency of the preset situation corresponding to the preset graphlet where the attribute information of the first POI and the attribute information of the second POI co-occur, comprises:
acquiring a first sorting list of the occurrence frequencies of respective preset situations, and a second sorting list of a preset number of hot preset situations ranked top in the first sorting list;
generating a first relationship feature of the first POI and the second POI, based on a ranking position of each preset graphlet, where the attribute information of the first POI and the attribute information of the second POI co-occur, in the first sorting list and occurrence frequencies of corresponding preset situations; and
generating a second relationship feature of the first POI and the second POI, based on a ranking position of each preset graphlet, where the attribute information of the first POI and the attribute information of the second POI co-occur, in the second sorting list and occurrence frequencies of corresponding preset situations.

### Claim 16 (depends on 15)

The device according to claim 15, wherein the operations further comprise:
generating a joint attribute feature of the first POI and the second POI based on the attribute information of the first POI and the attribute information of the second POI;
the pre-trained relationship prediction model comprises: a self-attention module and a cross-attention module; and
the self-attention module processes the second relationship feature based on a preset self-attention mechanism, and the cross-attention module processes the joint attribute feature and the second relationship feature based on a preset cross-attention mechanism.

### Claim 17 (depends on 16)

The device according to claim 16, wherein the pre-trained relationship prediction model further comprises: a multi-layer perceptron; and
the multi-layer perceptron is configured to predict a competition relationship between the first POI and the second POI, based on the first relationship feature corresponding to preset graphlets, a feature output by the self-attention module, and a feature output by the cross-attention module.

### Claim 18 (depends on 10)

The device according to claim 10, wherein the operations further comprise:
configuring a service resource related to the first POI based on the competition relationships between the first POI and at least two second POIs.

### Claim 19

A non-transitory computer readable storage medium, storing computer instructions, the computer instructions, being used to cause the computer to perform operations, the operations comprising:
acquiring a graphlet mining result obtained by mining map retrieval data of users, the map retrieval data comprising attribute information of retrieved target POIs, the graphlet mining result comprising occurrence frequencies of respective preset situations, and a preset situation comprising: conforming to attribute information of POIs represented by a corresponding preset graphlet and a preset association relationship between attribute information of at least two POIs represented by the corresponding preset graphlet;
for a first POI and a second POI between which a competition relationship is to be determined, determining, based on the graphlet mining result, an occurrence frequency of a preset situation corresponding to a preset graphlet where attribute information of the first POI and attribute information of the second POI co-occur, and generating a relationship feature of the first POI and the second POI based on the determined occurrence frequency of the preset situation corresponding to the preset graphlet where the attribute information of the first POI and the attribute information of the second POI co-occur; and
inputting the relationship feature of the first POI and the second POI into a pre-trained relationship prediction model to obtain a competition relationship prediction result of the first POI and the second POI.
