WO2017125083A1 - 用户信息推荐 - Google Patents

用户信息推荐 Download PDF

Info

Publication number
WO2017125083A1
WO2017125083A1 PCT/CN2017/071979 CN2017071979W WO2017125083A1 WO 2017125083 A1 WO2017125083 A1 WO 2017125083A1 CN 2017071979 W CN2017071979 W CN 2017071979W WO 2017125083 A1 WO2017125083 A1 WO 2017125083A1
Authority
WO
WIPO (PCT)
Prior art keywords
user
store
identifier
information
coupon
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.)
Ceased
Application number
PCT/CN2017/071979
Other languages
English (en)
French (fr)
Inventor
董尚先
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Sankuai Online Technology Co Ltd
Original Assignee
Beijing Sankuai Online Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Sankuai Online Technology Co Ltd filed Critical Beijing Sankuai Online Technology Co Ltd
Priority to US16/071,549 priority Critical patent/US10937047B2/en
Publication of WO2017125083A1 publication Critical patent/WO2017125083A1/zh
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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
    • G06Q30/00—Commerce
    • G06Q30/02—Marketing; Price estimation or determination; Fundraising
    • G06Q30/0207—Discounts or incentives, e.g. coupons or rebates
    • G06Q30/0224—Discounts or incentives, e.g. coupons or rebates based on user history
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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
    • G06Q30/00—Commerce
    • G06Q30/02—Marketing; Price estimation or determination; Fundraising
    • G06Q30/0207—Discounts or incentives, e.g. coupons or rebates
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/40—Information retrieval; Database structures therefor; File system structures therefor of multimedia data, e.g. slideshows comprising image and additional audio data
    • G06F16/43—Querying
    • G06F16/435—Filtering based on additional data, e.g. user or group profiles
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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/95—Retrieval from the web
    • G06F16/953—Querying, e.g. by the use of web search engines
    • G06F16/9535—Search customisation based on user profiles and personalisation
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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/95—Retrieval from the web
    • G06F16/955—Retrieval from the web using information identifiers, e.g. uniform resource locators [URL]
    • G06F16/9558—Details of hyperlinks; Management of linked annotations
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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
    • G06Q30/00—Commerce
    • G06Q30/02—Marketing; Price estimation or determination; Fundraising
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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
    • G06Q30/00—Commerce
    • G06Q30/02—Marketing; Price estimation or determination; Fundraising
    • G06Q30/0241—Advertisements
    • G06Q30/0251—Targeted advertisements
    • G06Q30/0255—Targeted advertisements based on user history
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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
    • G06Q10/00—Administration; Management
    • G06Q10/40—Business processes related to social networking or social networking services
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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
    • G06Q10/00—Administration; Management
    • G06Q10/40—Business processes related to social networking or social networking services
    • G06Q10/42—Determination of affinities or common interests between users

Definitions

  • the present invention relates to user information recommendation in the field of Internet communications.
  • the server may recommend other users' information to the user terminal, so that the user can get to know the recommended user and become a friend.
  • a method for recommending user information may include: the server acquires other users of the same age group and the same geographical area from the database according to the age, gender, and geographic location of the user, and the obtained information is obtained by the server. Other users' information is recommended to the user.
  • the number of friends recommended by the server may be large. If the friend recommended by the server sends a message to the user, it may cause trouble to the user. Other users recommended by the server may have less commonality with the user, and the reference may be poor, so it may be difficult for the user to get to know the friends who have a common topic from the other users mentioned above.
  • one of the purposes of embodiments of the present invention is to improve the referability of recommended user information.
  • an embodiment of the present invention provides a method for recommending user information, where the method may include:
  • the store identifier corresponding to the coupon is inquired from the list of coupons according to the identifier of the coupon.
  • the determining, according to the store identifier, the corresponding second user including:
  • the corresponding second user is determined according to the custom rule corresponding to the first user.
  • the method may further include:
  • the store-related information corresponding to the first user is stored in a store-related list corresponding to the verification terminal.
  • the method further includes:
  • the obtaining the user information of the second user, and recommending the user information of the second user to the first user includes:
  • the preset display manner includes a flop animation mode or a ripple gradient animation mode.
  • the method further includes:
  • an embodiment of the present invention provides an apparatus for recommending user information, including a processor, by executing machine readable instructions corresponding to control logic of a recommended user information stored on a storage medium and executing The instructions come to:
  • the machine readable instructions cause the processor to: when acquiring a corresponding store identification based on the identification of the coupon;
  • the store identifier corresponding to the coupon is inquired from the list of coupons according to the identifier of the coupon.
  • the machine readable instructions cause the processor to: when determining the second user based on the store identification:
  • the corresponding second user is determined according to the custom rule corresponding to the first user.
  • the machine readable instructions cause the processor to:
  • the store-related information corresponding to the first user is stored in a store-related list corresponding to the store identifier.
  • the machine readable instructions cause the processor to:
  • the machine readable instruction causes the processor to:
  • the preset display manner includes a flop animation mode or a ripple gradient animation mode.
  • the machine readable instructions cause the processor to:
  • the identifier of the first user's coupon is received; the corresponding store identifier is obtained according to the identifier of the coupon; the second user is determined according to the store identifier; and the user of the second user is determined
  • Information is recommended to the first user. Since the second user of the store is recommended for the first user when receiving the identifier of the coupon consumption of the first user in a certain store, the second user is also a user who consumes in the store, so the recommended The number of two users is limited, and the second user may have similar consumer tastes and lifestyles to the first user. Due to the consumption restriction, the possibility of recommending a malicious user to the user can be reduced, and the reference information of the recommended user information can be improved, and the user can get a friend who has a common topic from the recommended friends.
  • FIG. 1 is a flowchart of a method for recommending user information according to an embodiment of the present invention.
  • FIG. 2 is a schematic diagram showing the hardware structure of an apparatus for recommending user information according to an embodiment of the present invention.
  • FIG. 3A is a schematic diagram of functional modules of control logic for recommending user information according to an embodiment of the present invention.
  • FIG. 3B is a schematic diagram of functional blocks of control logic for recommending user information according to another embodiment of the present invention.
  • the server recommends other users' information according to the user's age, gender, and geographic location, and the number of recommended users may be large. If the recommended users send messages to the user, it may cause great trouble to the user. A large number of other users recommended by the server may contain malicious users, who may cause fraud and harassment to the user. Therefore, it can be known that the user information is less informative according to the user's age, gender, and geographical location, and it may be difficult for the user to get to know the friends who have a common topic from the other users mentioned above. Based on this, an embodiment of the present invention provides a method and an apparatus for recommending user information. Description will be made below by way of examples.
  • Embodiments of the present invention provide a method for recommending user information.
  • the method can combine the user's consumption behavior with the information recommendation, recommend other users with similar consumer tastes and lifestyles, and increase the cost of malicious users to fraud or malicious harassment by limiting the consumption behavior, thereby effectively Reduce the likelihood of recommending malicious users.
  • the method can include the following steps 101-104.
  • step 101 an identification of the first user's coupon is received.
  • the execution body of the embodiment of the present invention may be a server.
  • the server may be a server of a third party shopping platform, a server of an online group purchasing platform, or a server of a physical store.
  • the above coupons may be physical coupons or electronic coupons issued on the web.
  • a list of coupons can be stored in the server.
  • the coupon list may include an identifier of the coupon, a correspondence between the coupon amount and the store identifier.
  • the server may store the identifier of the coupon, the amount of the coupon, and the store identifier of the store corresponding to the coupon in the coupon list.
  • the first user may send a friend recommendation request to the server.
  • the friend recommendation request may include an identification of the coupon and a user identification of the user.
  • the server receives the friend recommendation request sent by the first user, the identifier of the coupon may be obtained from the friend recommendation request.
  • the embodiment of the present invention can also perform the friend when the user uses the coupon to the store. recommend.
  • the first user acquires a coupon and goes to a store corresponding to the coupon
  • the first user presents the coupon to the store clerk of the store
  • the store clerk of the store can pass the ticket inspection terminal of the store.
  • the coupon is verified.
  • the ticket verification terminal may scan the electronic coupon, or the employee inputs the identifier of the electronic coupon into the verification terminal, and the verification terminal sends a verification request to the server, and the verification The request may include an identification of the electronic coupon.
  • the verification terminal can obtain the identifier of the physical ticket by scanning a barcode or a two-dimensional code on the physical ticket.
  • the verification terminal may send an authentication request to the server.
  • the verification request may include an identification of the physical ticket.
  • the server receives the verification request sent by the verification terminal, and obtains the identifier of the coupon from the verification request, verifies the coupon, and feeds back the verification result to the ticket inspection terminal.
  • the specific verification process will not be described in detail here.
  • the server may further obtain the coupon amount corresponding to the coupon from the coupon list according to the identifier of the coupon.
  • the server may determine the number of recommendations corresponding to the first user according to the coupon amount and the preset single recommendation amount.
  • the store-related information corresponding to the first user may be generated according to the user identification (User Identification) of the first user, the store identifier, and the number of recommendations.
  • the user identifier, the store identifier, and the recommended number of the first user may be directly composed of the store-related information corresponding to the first user.
  • the preset single recommendation amount may be 5 or 10, etc., and the specific value of the preset single recommendation quota is not specifically limited in the embodiment of the present invention, and may be set according to requirements in actual operation.
  • a ratio between the amount of the coupon and the preset one-time recommendation amount may be calculated, and the ratio is determined as the number of recommendations corresponding to the first user. For example, if the coupon amount is 50 and the preset single recommendation amount is 5, the number of recommendations may be 10 times.
  • the store association list of each store may also be stored in the server, and the store association list may store store related information of all users consumed in the store.
  • the store-related information corresponding to the first user may be stored in the store-related list corresponding to the store identifier. Assuming that the user identifier of the first user is User1, the store identifier of the store to which the coupon belongs is shop1, and the number of recommendations corresponding to the first user is 10 times, the store association list corresponding to the coupon terminal may be as shown in Table 1. Show.
  • a corresponding store identification is obtained based on the identification of the coupon.
  • the server After receiving the identifier of the first user's coupon, the server obtains the stored coupon list, and searches the coupon list for the store identifier corresponding to the coupon of the coupon according to the identifier of the coupon.
  • a second user is determined based on the store identification.
  • the store association list corresponding to the store identifier is retrieved. From the store association list, the corresponding second user is determined according to the custom rule corresponding to the first user.
  • the custom rule corresponding to the first user may be a friend matching rule set when the first user registers in the server.
  • the custom rule can be stored in the account information of the first user.
  • Custom rules can specify the gender, age, and number of recommended friends.
  • the server may perform a subtraction operation on the number of recommendations in the store association information corresponding to the second user in the store association list corresponding to the store identifier. It is determined whether the recommended number of times corresponding to the second user after the subtraction operation is 0, and if so, the store related information corresponding to the second user is deleted from the store association list.
  • the recommended times 1 and 5 corresponding to User2 and User3 are respectively decremented.
  • the number of recommended times corresponding to User2 is 0, and the number of recommended times corresponding to User3 is 4, and the store-related information corresponding to User2 is deleted from the store-related list, as shown in Table 2.
  • the presence of such a user may reduce the likelihood that the first user actually encounters the recommended second user. Decrease the number of recommendations for the recommended second user by one, The number of recommendations of the second user can be shortened more quickly, and the second user who consumes less frequently can be reduced, thereby improving the possibility that the first user actually encounters the recommended second user. In addition, the number of recommendations of the recommended second user is reduced by one. When the number of recommendations is reduced to 0, only the customer can go to the store again to participate in the friend recommendation, so that more users can be motivated to continue to consume at the store.
  • the number of recommendations of the first user that obtains the user information recommended by the friend may be reduced by one.
  • the recommended second user and the recommended number of times of the first user who obtains the recommended user information may be simultaneously decremented.
  • the store related information of the user will be deleted from the store association list, and the user can participate in the friend recommendation only by going to the store again. .
  • This ensures that the recommended users are spending at the store in a short period of time, which increases the likelihood that the user will meet the recommended user at the store, and the recommended user and user may have similar consumer tastes and lifestyles.
  • the possibility of recommending a malicious user can be effectively reduced.
  • step 104 user information of the second user is obtained, and user information of the second user is recommended to the first user.
  • the server may record the historical store information corresponding to the user in the account information of the user.
  • the historical store information may be related information such as a store identification, a store address, and a consumption time of a store that the user has consumed in the past.
  • the server may obtain the determined user identifier of the second user and the historical store information corresponding to the second user. Generating user information of the second user according to the user identifier of the second user and the corresponding historical store information. Sending the user information of the second user and the preset display manner to the first user, and the preset display manner may include a flop animation mode or a ripple gradient animation mode.
  • the server may obtain the historical store information corresponding to the second user from the account information of the second user according to the determined user identifier of the second user.
  • the server may use the second user identifier and the acquired historical store information as the user information of the second user.
  • the user information of the second user may also include other information such as the age and gender of the second user.
  • the first user may display the recommended user information of the second user to the first user in the preset display manner.
  • the server may also not send the preset display manner to the first user, but the first user may customize the display manner on the terminal.
  • the recommended friends can be displayed by a preset display manner such as a flop animation method or a ripple gradient animation method, which can increase the interest of recommending user information and improve the user experience.
  • the first After the user information of the second user is recommended to the first user, the first The current location of the two users.
  • the occasional prompt information may be sent to the first user and the second user.
  • the server can locate the recommended second user through a GPS (Global Positioning System) to obtain the current location of the second user. Or the server may obtain the current location of the second user directly from the second user request.
  • a GPS Global Positioning System
  • the server may obtain the current location of the second user directly from the second user request.
  • the application scenario of the method provided by the embodiment of the present invention is very broad. The following is only a few application scenarios.
  • the embodiment of the present invention does not specifically limit the application scenario of the method for recommending user information.
  • the server of the group purchase network can associate the user with the physical store
  • the method provided by the embodiment of the present invention is The user recommends other users who are spending the same money at the physical store.
  • the server of the third-party shopping platform may associate the user with the online store corresponding to the product, and recommend the same online shop for the user by using the method provided by the embodiment of the present invention.
  • Other users of consumption may be used.
  • the server of the physical consumption place may associate the user with the physical consumption place, and the method provided by the embodiment of the present invention is This user recommends other users who are spending at these locations.
  • the coupon purchase is combined with the friend recommendation, and only the consumer can participate in the friend recommendation, thereby increasing the cost of participating in the friend recommendation, effectively reducing the malicious user participating in the friend recommendation, and recommending to the user by the friend. Fraud and spam harassment.
  • users who go to the same store are likely to live in similar locations and are likely to have similar consumer tastes and lifestyles. Therefore, the friend recommended by the method provided by the present invention has strong referenceability, and the user can get friends with common topics among other users who are recommended.
  • the encounter message may be sent to the user and the other user, thereby increasing the chance that the user actually meets the other users recommended.
  • the identifier of the first user's coupon is received; the corresponding store identifier is determined according to the identifier of the coupon; the second user is determined according to the store identifier; and the user information of the second user is recommended to The first user. Since the second user of the store is recommended for the first user when receiving the identification of the coupon of the first user at a certain store, the second user is also a user who consumes at the store, so the recommended The number of two users is limited, and the second user is likely to have a similar consumer taste and lifestyle with the first user. Due to the consumption restriction, the possibility of recommending a malicious user to the first user may be reduced, and the reference information of the recommended user information may be improved, and the first user may refer to the recommendation. In the user information, I met friends who really have a common topic.
  • an embodiment of the present invention provides a hardware structure diagram of an apparatus for recommending user information, where the apparatus is used to perform the method for recommending user information provided by Embodiment 1 above.
  • the means for recommending user information may include a processor 21 and a machine readable storage medium 22, wherein the processor 21 and the machine readable storage medium 22 are typically interconnected by an internal bus 23.
  • the means for recommending user information may also include an external interface 24 to enable communication with other devices or components.
  • the machine readable storage medium 22 can be: RAM (Radom Access Memory), volatile memory, nonvolatile memory, flash memory, storage drive (eg, hard drive), solid state Hard disk, any type of storage disk (such as a compact disc, DVD, etc.), or similar storage medium, or a combination thereof.
  • RAM Random Access Memory
  • volatile memory nonvolatile memory
  • flash memory storage drive (eg, hard drive), solid state Hard disk, any type of storage disk (such as a compact disc, DVD, etc.), or similar storage medium, or a combination thereof.
  • storage drive eg. hard drive
  • solid state Hard disk any type of storage disk (such as a compact disc, DVD, etc.), or similar storage medium, or a combination thereof.
  • control logic 30 for recommending user information may include a receiving module 301, an obtaining module 302, a determining module 303, and a recommending module 304.
  • the receiving module 301 can be configured to receive an identifier of the first user's coupon.
  • the obtaining module 302 can be configured to obtain a corresponding store identifier according to the identifier of the coupon.
  • the determining module 303 is operative to determine the second user based on the store identification.
  • the recommendation module 304 is configured to obtain user information of the second user, and recommend user information of the second user to the first user.
  • the obtaining module 302 may be configured to obtain a stored coupon list, and query, according to the identifier of the coupon, the store identifier corresponding to the coupon from the coupon list.
  • the determining module 303 can retrieve the store association list corresponding to the store identifier according to the store identifier, and determine the corresponding one according to the custom rule corresponding to the first user from the store association list. Second user.
  • control logic 30 for recommending user information may further include a store associated information generating module and a storage module.
  • the store association information generating module may be configured to determine, according to the identifier of the coupon, the amount of the coupon corresponding to the coupon; and determine the number of recommendations corresponding to the first user according to the coupon amount and the preset single recommendation amount; The first user's user identification, the store identification, and the recommended number of times generate the store-related information corresponding to the first user.
  • the storage module is configured to store the store-related information corresponding to the first user in a store-related list corresponding to the store identifier.
  • control logic 30 of the recommended user information may also update the store association list corresponding to the store identifier by subtracting the operation module 305 and the deleting module 306 as follows.
  • the minus one operation module 305 can be configured to perform a subtraction operation on the number of recommendations in the store association information corresponding to the second user in the store association list corresponding to the store identifier.
  • the deletion module 306 can be configured to determine whether the recommended number of times corresponding to the second user after the one-time operation is 0, and if yes, delete the store-related information corresponding to the second user from the store-related list.
  • the recommendation module 304 is configured to acquire the user identifier of the second user and the historical store information corresponding to the second user, and generate the second according to the user identifier of the second user and the historical store information.
  • User information of the user and sending the user information of the second user and the preset display manner to the first user.
  • the preset display method may include a flop animation method or a ripple gradient animation method.
  • the control logic 30 of the recommended user information further determines, by the sending module, whether the recommended second user is likely to encounter the first user, and When it is determined that there is an possibility of encounter, the encountering prompt information is sent to the first user and the second user.
  • the sending module is configured to determine a current location of the second user, and when determining that the current location of the second user is a store corresponding to the store identifier, sending the occasional prompt information to the first user and the second user.
  • the identifier of the first user's coupon is received; the corresponding store identifier is obtained according to the identifier of the coupon; the second user is determined according to the store identifier; and the user information of the second user is obtained.
  • the user information of the second user is recommended to the first user. Since the first user is recommended for the first user when the first user is purchasing at the store, the second user who is also consumed in the store or has consumed in the store is recommended, so the number of recommended second users is limited, and the second user There may be similar consumer tastes and lifestyles to the first user. Due to the consumption restriction, the possibility of recommending a malicious user to the user can be reduced, and the reference information of the recommended user information can be effectively improved, so that the user can get a friend who has a common topic from the recommended user.
  • control logic of the present invention can be understood as machine readable instructions stored in machine readable storage medium 22.
  • the processor 21 on the apparatus for recommending user information of the present invention executes the control logic, the processor 21 performs the following operations by calling machine readable instructions stored on the machine readable storage medium 22:
  • the machine readable instructions stored on the machine readable storage medium 22 may cause the processor 21 to:
  • the store identifier corresponding to the coupon is inquired from the list of coupons according to the identifier of the coupon.
  • the machine readable instructions stored on the machine readable storage medium 22 may cause the processor 21 to:
  • the corresponding second user is determined according to the custom rule corresponding to the first user.
  • machine readable instructions stored on machine readable storage medium 22 may cause said processor 21 to:
  • the store-related information corresponding to the first user is stored in a store-related list corresponding to the store identifier.
  • machine readable instructions stored on the machine readable storage medium 22 may cause the processor 21 to:
  • the machine readable instructions saved on the machine readable storage medium 22 may be Promoting the processor 21:
  • the preset display manner includes a flop animation mode or a ripple gradient animation mode.
  • machine readable instructions stored on the machine readable storage medium 22 may cause the processor 21 to:
  • control logic for recommending user information provided by the embodiment of the present invention may be specific hardware on the device or software or firmware installed on the device.
  • a person skilled in the art can clearly understand that for the convenience and brevity of the description, the specific working processes of the modules and units described above can refer to the corresponding processes in the foregoing method embodiments.
  • the disclosed apparatus and method can be implemented in other ways.
  • the device embodiments described above are merely illustrative.
  • the division of the unit is only a logical function division.
  • multiple units or components may be combined or Can be integrated into another system, or some features can be ignored or not executed.
  • the mutual coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some communication interface, device or unit, and may be electrical, mechanical or otherwise.
  • the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of the embodiment.
  • each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
  • the functions may be stored in a computer readable storage medium if implemented in the form of a software functional unit and sold or used as a standalone product.
  • the technical solution of the present invention which is essential or contributes to the prior art, or a part of the technical solution, may be embodied in the form of a software product, which is stored in a storage medium, including
  • the instructions are used to cause a computer device (which may be a personal computer, server, or network device, etc.) to perform all or part of the steps of the methods described in various embodiments of the present invention.
  • the foregoing storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk, and the like. .

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Accounting & Taxation (AREA)
  • Development Economics (AREA)
  • Finance (AREA)
  • Strategic Management (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Marketing (AREA)
  • General Business, Economics & Management (AREA)
  • Economics (AREA)
  • Game Theory and Decision Science (AREA)
  • Databases & Information Systems (AREA)
  • Data Mining & Analysis (AREA)
  • General Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

本发明提供了一种推荐用户信息的方法及装置。根据一个实施例，该方法包括：接收第一用户的消费券的标识；根据消费券的标识，获取对应的门店标识；根据该门店标识，确定第二用户；获取所述第二用户的用户信息，将所述第二用户的用户信息推荐给所述第一用户。

Description

用户信息推荐
相关申请的交叉引用
本专利申请要求于2016年01月22日提交的、申请号为201610046826.0、发明名称为“一种推荐用户信息的方法及装置”的中国专利申请的优先权，该申请的全文以引用的方式并入本文中。
技术领域
本发明涉及互联网通信领域中的用户信息推荐。
背景技术
目前，用户经常登录社交网络，并与社交网络中的好友进行交流。为了使用户通过社交网络结交更多的好友，服务器可以向用户终端推荐其他用户的信息，以使用户能够结识推荐的用户并成为好友。
一种推荐用户信息的方法可包括：服务器根据用户的年龄、性别及地理位置等信息，从数据库中获取与该用户在同一年龄段、同一地理区域内的同性或异性的其他用户，将获取的其他用户的信息推荐给该用户。
若根据用户的年龄、性别及地理位置等信息向用户推荐其他用户的信息，服务器推荐的好友数量可能很大。若服务器推荐的好友都向用户发送消息，可能会给用户造成困扰。服务器推荐的其他用户可能与用户之间的共同点较少，可参考性可能较差，因此用户可能很难从上述推荐的其他用户中结识到真正有共同话题的好友。
发明内容
有鉴于此，本发明实施例的目的之一在于提高推荐用户信息的可参考性。
第一方面，本发明实施例提供了一种推荐用户信息的方法，所述方法可包括：
接收第一用户的消费券的标识；
根据所述消费券的标识，获取对应的门店标识；
根据所述门店标识，确定第二用户；
获取所述第二用户的用户信息，将所述第二用户的用户信息推荐给所述第一用户。
其中，所述根据所述消费券的标识，获取对应的门店标识，包括：
获取已存储的消费券列表；
根据所述消费券的标识，从所述消费券列表中查询所述消费券对应的门店标识。
其中，所述根据所述门店标识，确定对应的第二用户，包括：
根据所述门店标识，调取所述门店标识对应的门店关联列表；
从所述门店关联列表中，按照所述第一用户对应的自定义规则确定对应的第二用户。
在本发明的一个实施例中，所述方法还可包括：
根据所述消费券的标识，确定所述消费券对应的消费券金额；
根据所述消费券金额及预设单次推荐额度，确定所述第一用户对应的推荐次数；
根据所述第一用户的用户标识、所述门店标识及所述推荐次数，生成所述第一用户对应的门店关联信息；
将所述第一用户对应的门店关联信息存储在所述验券终端对应的门店关联列表中。
在本发明的一个实施例中，所述方法还包括：
在所述门店标识对应的门店关联列表中，对所述第二用户对应的门店关联信息中的推荐次数进行减一操作；
判断减一操作后所述第二用户对应的推荐次数是否为0，如果是，则从所述门店关联列表中删除所述第二用户对应的门店关联信息。
其中，所述获取所述第二用户的用户信息，将所述第二用户的用户信息推荐给所述第一用户，包括：
获取所述第二用户的用户标识及所述第二用户对应的历史门店信息；
根据所述第二用户的用户标识及所述历史门店信息，生成所述第二用户的用户信息；
向所述第一用户发送所述第二用户的用户信息及预设展示方式，所述预设展示方式包括翻牌动画方式或波纹渐变动画方式。
在本发明一个实施例中，所述方法还包括：
确定所述第二用户的当前位置，当确定所述第二用户的当前位置为所述门店标识对应的门店时，发送偶遇提示信息给所述第一用户及所述第二用户。
第二方面，本发明实施例提供了一种推荐用户信息的装置，包括处理器，所述处理器通过读取存储介质上所存储的与推荐用户信息的控制逻辑对应的机器可读指令并执行所述指令来：
接收第一用户的消费券的标识；
根据所述消费券的标识，获取对应的门店标识；
根据所述门店标识，确定第二用户；
获取所述第二用户的用户信息，将所述第二用户的用户信息推荐给所述第一用户。
在本发明一个实施例中，当根据所述消费券的标识，获取对应的门店标识时，所述机器可读指令促使所述处理器：
获取已存储的消费券列表；
根据所述消费券的标识，从所述消费券列表中查询所述消费券对应的门店标识。
在本发明一个实施例中，当根据所述门店标识，确定第二用户时，所述机器可读指令促使所述处理器：
根据所述门店标识，调取所述门店标识对应的门店关联列表；
从所述门店关联列表中，按照所述第一用户对应的自定义规则确定对应的第二用户。
在本发明一个实施例中，所述机器可读指令促使所述处理器：
根据所述消费券的标识，确定所述消费券对应的消费券金额；
根据所述消费券金额及预设单次推荐额度，确定所述第一用户对应的推荐次数；
根据所述第一用户的用户标识、所述门店标识及所述推荐次数，生成所述第一用户对应的门店关联信息；
将所述第一用户对应的门店关联信息存储在所述门店标识对应的门店关联列表中。
在本发明一个实施例中，所述机器可读指令促使所述处理器：
在所述门店标识对应的门店关联列表中，对所述第二用户对应的门店关联信息中的推荐次数进行减一操作；
判断减一操作后所述第二用户对应的推荐次数是否为0，如果是，则从所述门店关联列表中删除所述第二用户对应的门店关联信息。
在本发明一个实施例中，当获取所述第二用户的用户信息，将所述第二用户的用户信息推荐给所述第一用户时，所述机器可读指令促使所述处理器：
获取所述第二用户的用户标识及所述第二用户对应的历史门店信息；
根据所述第二用户的用户标识及所述历史门店信息，生成所述第二用户的用户信息；
向所述第一用户发送所述第二用户的用户信息及预设展示方式，所述预设展示方式包括翻牌动画方式或波纹渐变动画方式。
在本发明一个实施例中，所述机器可读指令促使所述处理器：
确定所述第二用户的当前位置，当确定所述第二用户的当前位置为所述门店标识对应的门店时，发送偶遇提示信息给所述第一用户及所述第二用户。
在本发明实施例提供的方法及装置中，接收第一用户的消费券的标识；根据消费券的标识，获取对应的门店标识；根据该门店标识，确定第二用户；将第二用户的用户信息推荐给所述第一用户。由于当接收到所述第一用户在某门店的券消费的标识时，为所述第一用户推荐该门店的第二用户，所述第二用户也是在该门店消费的用户，所以推荐的第二用户的数量有限，且第二用户可能与所述第一用户有相似的消费品味和生活方式。由于有消费限制，可减少向用户推荐恶意用户的可能性，提高了推荐用户信息的可参考性，用户可以从推荐的好友中结识到真正有共同话题的好友。
附图说明
为了更清楚地说明本发明实施例的技术方案，下面将对实施例中所需要使用的附图作简单地介绍，应当理解，以下附图仅示出了本发明的某些实施例，因此不应被看作是对范围的限定，对于本领域普通技术人员来讲，在不付出创造性劳动的前提下，还可以根据这些附图获得其他相关的附图。
图1示出了本发明一实施例所提供的一种推荐用户信息的方法流程图。
图2示出了本发明一实施例所提供的一种推荐用户信息的装置的硬件结构示意图。
图3A示出了本发明一实施例所提供的一种推荐用户信息的控制逻辑的功能模块示意图。
图3B示出了本发明另一实施例所提供的一种推荐用户信息的控制逻辑的功能模块示意图。
具体实施方式
下面将结合本发明实施例中附图，对本发明实施例中的技术方案进行清楚、完整地描述，显然，所描述的实施例仅仅是本发明一部分实施例，而不是全部的实施例。通常在此处附图中描述和示出的本发明实施例的组件可以以各种不同的配置来布置和设计。因此，以下对在附图中提供的本发明的实施例的详细描述并非旨在限制要求保护的本发明的范围，而是仅仅表示本发明的选定实施例。基于本发明的实施例，本领域技术人员在没有做出创造性劳动的前提下所获得的所有其他实施例，都属于本发明保护的范围。
服务器根据用户的年龄、性别及地理位置等信息向用户推荐其他用户的信息，推荐的用户数量可能很大。若推荐的用户都向该用户发送消息，可能会给用户造成很大困扰。服务器推荐的大量其他用户中可能包含恶意用户，恶意用户可能会给用户带来欺诈和骚扰。由此可知，根据用户的年龄、性别及地理位置推荐用户信息的可参考性较差，用户可能很难从上述推荐的其他用户中结识到真正有共同话题的好友。基于此，本发明实施例提供了一种推荐用户信息的方法及装置。下面通过实施例进行描述。
本发明实施例提供了一种推荐用户信息的方法。该方法可将用户的消费行为与信息推荐结合起来，为用户推荐具有相似消费品味和生活方式的其他用户，并且通过对消费行为的限制可增加恶意用户进行欺诈或恶意骚扰的成本，从而可有效减少推荐恶意用户的可能性。
参见图1，该方法可包括以下步骤101-104。
在步骤101，接收第一用户的消费券的标识。
本发明实施例的执行主体可为服务器。该服务器可以为第三方购物平台的服务器、网上团购平台的服务器或实体商店的服务器等。上述消费券可以为实体票券或网络上发行的电子券等。
服务器中可存储有消费券列表。该消费券列表可包括消费券的标识、消费券金额与门店标识的对应关系。当发行新的消费券时，服务器可将该消费券的标识、消费券金额及该消费券对应的门店的门店标识存储在消费券列表中。
当第一用户获取消费券时，所述第一用户可发送好友推荐请求给服务器。该好友推荐请求可包括该消费券的标识和该用户的用户标识。当服务器接收所述第一用户发送的好友推荐请求时，可从该好友推荐请求中获取该消费券的标识。
目前用户从第三方购物平台或网上团购平台等获取消费券时可以不必支付费用，而是到该消费券对应的门店使用该消费券时才进行支付。因此，为了提高进行好友推荐的成本，以降低推荐恶意用户的可能性，本发明实施例还可以在用户使用消费券到店消费时才进行好友 推荐。
例如，当所述第一用户获取消费券并到该消费券对应的门店进行消费时，所述第一用户向该门店的店员出示该消费券，该门店的店员可通过该门店的验券终端对该消费券进行验证。在验证该消费券时，若该消费券为电子券，则验券终端可扫描该电子券，或者店员将该电子券的标识输入该验券终端，验券终端发送验证请求给服务器，该验证请求可包括该电子券的标识。若该消费券为实体票券，则验券终端通过扫描该实体票券上的条形码或二维码等可得到该实体票券的标识。所述验券终端可发送验证请求给服务器。该验证请求可包括该实体票券的标识。
此时服务器接收验券终端发送的验证请求，可从该验证请求中获取该消费券的标识，对该消费券进行验证，并将验证结果反馈给验券终端。具体验证过程，在此不进行详述。
在本发明实施例中，当所述第一用户获取消费券时，服务器还可根据该消费券的标识，从消费券列表中获取该消费券对应的消费券金额。根据该消费券金额及预设单次推荐额度，服务器可确定该第一用户对应的推荐次数。根据该第一用户的用户标识(User Identification)、门店标识及该推荐次数，可生成所述第一用户对应的门店关联信息。本发明实施例中，可以直接将该第一用户的用户标识、门店标识及推荐次数组成所述第一用户对应的门店关联信息。
上述预设单次推荐额度可以为5或10等，本发明实施例并不具体限定预设单次推荐额度的具体数值，实际操作中可根据需求进行设置。
在确定所述第一用户对应的推荐次数时，可计算消费券金额与预设单次推荐额度之间的比值，将该比值确定为所述第一用户对应的推荐次数。例如，消费券金额为50，预设单次推荐额度为5，则推荐次数可为10次。
在本发明实施例中，服务器中还可存储有各个门店的门店关联列表，门店关联列表中可存储有在该门店消费的所有用户的门店关联信息。上述生成所述第一用户对应的门店关联信息之后，还可以将所述第一用户对应的门店关联信息存储在上述门店标识对应的门店关联列表中。假设该第一用户的用户标识为User1，该消费券所属的门店的门店标识为shop1，该第一用户对应的推荐次数为10次，则该验券终端对应的门店关联列表可如表1所示。
表1
用户标识 门店标识 推荐次数
User1 shop1 10
User2 shop1 1
User3 shop1 5
User4 shop1 30
… … …
在步骤102，根据该消费券的标识，获取对应的门店标识。
服务器接收到所述第一用户的消费券的标识后，获取已存储的消费券列表，根据该消费券的标识，从该消费券列表中查询该消费券的标识对应的门店标识。
在步骤103，根据该门店标识，确定第二用户。
根据该门店标识，调取该门店标识对应的门店关联列表。从该门店关联列表中，按照第一用户对应的自定义规则确定对应的第二用户。
所述第一用户对应的自定义规则可为所述第一用户在服务器中注册时设置的好友匹配规则。该自定义规则可存储在所述第一用户的账户信息中。自定义规则可以规定推荐的好友的性别、年龄及数量等。在从门店关联列表中确定需要推荐的第二用户时，首先根据该第一用户的用户标识，从该第一用户的账户信息中获取该第一用户对应的自定义规则，然后从门店关联列表中除该第一用户以外的其他用户中确定符合该自定义规则的第二用户。
在确定出需要推荐的第二用户之后，服务器可在上述门店标识对应的门店关联列表中，对所述第二用户对应的门店关联信息中的推荐次数进行减一操作。判断减一操作后第二用户对应的推荐次数是否为0，如果是，则从门店关联列表中删除第二用户对应的门店关联信息。
例如，确定出可推荐的第二用户的用户标识为表1中的User2和User3，则对User2和User3分别对应的推荐次数1和5进行减一操作。减一操作后User2对应的推荐次数为0，User3对应的推荐次数为4，则从门店关联列表中删除User2对应的门店关联信息，如表2所示。
表2
用户标识 门店标识 推荐次数
User1 shop1 10
User3 shop1 4
User4 shop1 30
… … …
由于有的用户可能只在门店中消费少数几次就不再到该门店消费了，这种用户的存在可能减少第一用户与推荐的第二用户实际偶遇的可能性。将所推荐的第二用户的推荐次数减一， 可以更快地缩小第二用户的推荐次数，减少消费次数很少的第二用户，从而可提高第一用户与推荐的第二用户实际偶遇的可能性。另外，将所推荐的第二用户的推荐次数减一，当推荐次数减到0后只有再次到该门店进行消费才能再次参与好友推荐，如此可以激励更多用户不断到该门店进行消费。
在本发明实施例中，除上述只对所推荐的第二用户的推荐次数减一的方式外，还可以只对获取好友推荐的用户信息的第一用户的推荐次数减一。或者，还可同时对所推荐的第二用户及获取推荐用户信息的第一用户的推荐次数进行减一操作。
由于推荐次数是根据消费券金额确定的，且当用户的推荐次数减到0之后，就将从门店关联列表中删除该用户的门店关联信息，该用户只有再次到该门店进行消费才能参与好友推荐。如此可保证所推荐的用户短期内都在该门店消费，可提高用户与所推荐的用户在该门店偶遇的可能性，且推荐的用户与用户可能有相似的消费品味和生活方式。另外，由于只有进行了消费才能参与好友推荐，可以有效减少推荐恶意用户的可能性。
在步骤104，获取所述第二用户的用户信息，将所述第二用户的用户信息推荐给所述第一用户。
在本发明实施例中，服务器可在用户的账户信息中记录用户对应的历史门店信息。该历史门店信息可为用户过去消费的门店的门店标识、门店地址及消费时间等相关信息。
在确定出可推荐的第二用户之后，服务器可获取确定的第二用户的用户标识及所述第二用户对应的历史门店信息。根据所述第二用户的用户标识及对应的历史门店信息，生成第二用户的用户信息。向所述第一用户发送所述第二用户的用户信息及预设展示方式，该预设展示方式可包括翻牌动画方式或波纹渐变动画方式。
服务器根据确定的第二用户的用户标识，可从第二用户的账户信息中获取第二用户对应的历史门店信息。服务器可将所述第二用户标识及获取的历史门店信息作为所述第二用户的用户信息。第二用户的用户信息还可以包括第二用户的年龄和性别等其它信息。
服务器将第二用户的用户信息及预设展示方式发送给所述第一用户后，所述第一用户可以以所述预设展示方式将推荐的第二用户的用户信息显示给所述第一用户。服务器也可以不将上述预设展示方式发送给所述第一用户，而是由所述第一用户在终端上自定义展示方式。本发明实施例中可通过翻牌动画方式或波纹渐变动画方式等预设展示方式来显示推荐的好友，能够增加推荐用户信息的趣味性，改善用户体验。
在本发明实施例中，将第二用户的用户信息推荐给所述第一用户之后，还可确定所述第 二用户的当前位置。当确定第二用户的当前位置为上述门店标识对应的门店时，可发送偶遇提示信息给所述第一用户及所述第二用户。
服务器可以通过GPS(Global Positioning System，全球定位系统)对推荐的第二用户进行定位，得到第二用户的当前位置。或者服务器可直接从第二用户请求获得第二用户的当前位置。当确定第二用户的当前位置为上述门店标识对应的门店时，由于所述第一用户正在该门店进行验券消费，所以可以确定该第二用户跟该第一用户同时在该门店内。此时可发送偶遇提示信息给所述第一用户及该第二用户，该偶遇提示信息可以包括该第一用户的用户信息、该第二用户的用户信息及用于提示偶遇的文本信息等。
本发明实施例提供的方法应用场景非常广泛，以下仅列举几种应用场景，但本发明实施例并不具体限定该推荐用户信息的方法的应用场景。例如，用户在团购网上购买了电子券，并去该电子券所属的实体门店进行验券消费时，团购网的服务器可将该用户与该实体门店关联，并通过本发明实施例提供的方法为该用户推荐同在该实体门店验券消费的其他用户。又如，用户在第三方购物平台购买商品后，第三方购物平台的服务器可将该用户与该商品对应的网上店铺关联，并通过本发明实施例提供的方法为该用户推荐同在该网上店铺消费的其他用户。再如，用户去电影院、运动场、健身房、游乐场或演唱会等实体消费场所消费时，这些实体消费场所的服务器可将该用户与该实体消费场所关联，并通过本发明实施例提供的方法为该用户推荐同在这些场所消费的其他用户。
在本发明实施例中，验券消费与好友推荐结合起来，只有进行消费才能参与好友推荐，如此提高了参与好友推荐的成本，可有效减少参与好友推荐的恶意用户，以及由好友推荐给用户带来的欺诈及垃圾广告的骚扰等。另外，去同一家店消费的用户很可能居住的地理位置相近，且极可能具有相似的消费品味及生活方式。因此，通过本发明提供的方法推荐的好友的可参考性很强，用户可以在推荐的其他用户中结识具有共同话题的好友。而且在用户正在门店中进行消费时，若确定出推荐的其他用户正在此门店时，可向该用户及该其他用户发送偶遇提示信息，增加了用户与推荐的其他用户真实相遇的机会。
在本发明实施例中，接收第一用户的消费券的标识；根据消费券的标识，确定对应的门店标识；根据该门店标识，确定第二用户；将所述第二用户的用户信息推荐给所述第一用户。由于当接收到所述第一用户在某门店的消费券的标识时，为所述第一用户推荐该门店的第二用户，所述第二用户也是在该门店消费的用户，所以推荐的第二用户的数量有限，且第二用户很可能与所述第一用户有相似的消费品味和生活方式。由于有消费限制，可减少向所述第一用户推荐恶意用户的可能性，提高了推荐用户信息的可参考性，所述第一用户可以从推荐 的用户信息中结识到真正有共同话题的好友。
参见图2，本发明实施例提供了一种推荐用户信息的装置的硬件结构示意图，该装置用于执行上述实施例1提供的推荐用户信息的方法。所述推荐用户信息的装置可包括处理器21以及机器可读存储介质22，其中，处理器21和机器可读存储介质22通常借由内部总线23相互连接。在其他可能的实现方式中，所述推荐用户信息的装置还可能包括外部接口24，以能够与其他设备或者部件进行通信。
在不同的例子中，所述机器可读存储介质22可以是：RAM(Radom Access Memory，随机存取存储器)、易失存储器、非易失性存储器、闪存、存储驱动器(如硬盘驱动器)、固态硬盘、任何类型的存储盘(如光盘、DVD等)，或者类似的存储介质，或者它们的组合。
进一步地，机器可读存储介质22上可存储由处理器21执行的推荐用户信息的控制逻辑30对应的机器可读指令。这样，在处理器21读取并执行机器可读存储介质22上所存储的机器可读指令时，所述处理器21可执行如上所述的推荐用户信息的方法。从功能上划分，如图3A所示，所述推荐用户信息的控制逻辑30可以包括接收模块301、获取模块302、确定模块303和推荐模块304。
接收模块301可用于接收第一用户的消费券的标识。
获取模块302可用于根据消费券的标识，获取对应的门店标识。
确定模块303可用于根据该门店标识，确定第二用户。
推荐模块304可用于获取所述第二用户的用户信息，将所述第二用户的用户信息推荐给所述第一用户。
上述获取模块302可用于获取已存储的消费券列表，并根据所述消费券的标识从所述消费券列表中查询所述消费券对应的门店标识。
在本发明实施例中，确定模块303可根据该门店标识，调取该门店标识对应的门店关联列表，并从该门店关联列表中，按照所述第一用户对应的自定义规则来确定对应的第二用户。
在本发明实施例中，所述推荐用户信息的控制逻辑30可还包括门店关联信息生成模块和存储模块。
门店关联信息生成模块可用于根据消费券的标识，确定所述消费券对应的消费券金额；根据消费券金额及预设单次推荐额度，确定所述第一用户对应的推荐次数；根据所述第一用户的用户标识、门店标识及推荐次数，生成所述第一用户对应的门店关联信息。
存储模块可用于将所述第一用户对应的门店关联信息存储在门店标识对应的门店关联列表中。
在确定模块303确定出对应的第二用户之后，所述推荐用户信息的控制逻辑30还可通过如下减一操作模块305和删除模块306来更新该门店标识对应的门店关联列表。
减一操作模块305可用于在该门店标识对应的门店关联列表中，对所述第二用户对应的门店关联信息中的推荐次数进行减一操作。删除模块306可用于判断减一操作后第二用户对应的推荐次数是否为0，如果是，则从门店关联列表中删除所述第二用户对应的门店关联信息。
在本发明实施例中，推荐模块304可用于获取第二用户的用户标识及所述第二用户对应的历史门店信息，根据所述第二用户的用户标识及历史门店信息，生成所述第二用户的用户信息，并向第一用户发送所述第二用户的用户信息及预设展示方式。其中，预设展示方式可包括翻牌动画方式或波纹渐变动画方式。
在推荐模块304向第一用户推荐第二用户的用户信息之后，所述推荐用户信息的控制逻辑30还通过如下发送模块来确定推荐的第二用户是否有可能与该第一用户偶遇，并在确定出存在偶遇可能时，发送偶遇提示信息给所述第一用户和所述第二用户。
发送模块可用于确定所述第二用户的当前位置，当确定所述第二用户的当前位置为门店标识对应的门店时，发送偶遇提示信息给所述第一用户及所述第二用户。
在本发明实施例中，接收第一用户的消费券的标识；根据消费券的标识，获取对应的门店标识；根据该门店标识，确定第二用户；获取所述第二用户的用户信息，将所述第二用户的用户信息推荐给所述第一用户。由于当第一用户在门店验券消费时，为所述第一用户推荐也在该门店消费或曾在该门店消费过的第二用户，所以推荐的第二用户的数量有限，且第二用户可能与所述第一用户有相似的消费品味和生活方式。由于有消费限制，可减少向用户推荐恶意用户的可能性，并可有效提高推荐用户信息的可参考性，从而使得用户可从推荐的用户中结识到真正有共同话题的好友。
下面以软件实现为例，进一步描述推荐用户信息的装置如何执行该推荐用户信息的控制逻辑30。在该例子中，本发明控制逻辑可理解为存储在机器可读存储介质22中的机器可读指令。当本发明的推荐用户信息的装置上的处理器21执行该控制逻辑时，该处理器21通过调用机器可读存储介质22上保存的机器可读指令来执行如下操作：
接收第一用户的消费券的标识；
根据所述消费券的标识，获取对应的门店标识；
根据所述门店标识，确定第二用户；
获取所述第二用户的用户信息，将所述第二用户的用户信息推荐给所述第一用户。
本实施例中，当根据所述消费券的标识，获取对应的门店标识，机器可读存储介质22上保存的机器可读指令可促使所述处理器21：
获取已存储的消费券列表；
根据所述消费券的标识，从所述消费券列表中查询所述消费券对应的门店标识。
本实施例中，当根据所述门店标识，确定第二用户，机器可读存储介质22上保存的机器可读指令可促使所述处理器21：
根据所述门店标识，调取所述门店标识对应的门店关联列表；
从所述门店关联列表中，按照所述第一用户对应的自定义规则确定对应的第二用户。
本实施例中，机器可读存储介质22上保存的机器可读指令可促使所述处理器21：
根据所述消费券的标识，确定所述消费券对应的消费券金额；
根据所述消费券金额及预设单次推荐额度，确定所述第一用户对应的推荐次数；
根据所述第一用户的用户标识、所述门店标识及所述推荐次数，生成所述第一用户对应的门店关联信息；
将所述第一用户对应的门店关联信息存储在所述门店标识对应的门店关联列表中。
本实施例中，所述机器可读存储介质22上保存的机器可读指令可促使所述处理器21：
在所述门店标识对应的门店关联列表中，对所述第二用户对应的门店关联信息中的推荐次数进行减一操作；
判断减一操作后所述第二用户对应的推荐次数是否为0，如果是，则从所述门店关联列表中删除所述第二用户对应的门店关联信息。
本实施例中，当获取所述第二用户的用户信息，将所述第二用户的用户信息推荐给所述第一用户时，所述机器可读存储介质22上保存的机器可读指令可促使所述处理器21：
获取所述第二用户的用户标识及所述第二用户对应的历史门店信息；
根据所述第二用户的用户标识及所述历史门店信息，生成所述第二用户的用户信息；
向所述第一用户发送所述第二用户的用户信息及预设展示方式，所述预设展示方式包括翻牌动画方式或波纹渐变动画方式。
在本实施例中，所述机器可读存储介质22上保存的机器可读指令可促使所述处理器21：
确定所述第二用户的当前位置，当确定所述第二用户的当前位置为所述门店标识对应的门店时，发送偶遇提示信息给所述第一用户及所述第二用户。
本发明实施例所提供的推荐用户信息的控制逻辑可以为设备上的特定硬件或者安装于设备上的软件或固件等。所属领域的技术人员可以清楚地了解到，为描述的方便和简洁，前述描述的模块和单元的具体工作过程，均可以参考上述方法实施例中的对应过程。
在本申请所提供的几个实施例中，应该理解到，所揭露装置和方法，可以通过其它的方式实现。以上所描述的装置实施例仅仅是示意性的，例如，所述单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，又例如，多个单元或组件可以结合或者可以集成到另一个系统，或一些特征可以忽略，或不执行。另一点，所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些通信接口，装置或单元的间接耦合或通信连接，可以是电性，机械或其它的形式。
所述作为分离部件说明的单元可以是或者也可以不是物理上分开的，作为单元显示的部件可以是或者也可以不是物理单元，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部单元来实现本实施例方案的目的。
另外，在本发明各个实施例中的各功能单元可以集成在一个处理单元中，也可以是各个单元单独物理存在，也可以两个或两个以上单元集成在一个单元中。
所述功能如果以软件功能单元的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储介质中。基于这样的理解，本发明的技术方案本质上或者说对现有技术做出贡献的部分或者该技术方案的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本发明各个实施例所述方法的全部或部分步骤。而前述的存储介质包括：U盘、移动硬盘、只读存储器(ROM，Read-Only Memory)、随机存取存储器(RAM，Random Access Memory)、磁碟或者光盘等各种可以存储程序代码的介质。
需要说明的是，在本文中，诸如第一和第二等之类的关系术语仅仅用来将一个实体或者操作与另一个实体或操作区分开来，而不一定要求或者暗示这些实体或操作之间存在任何这种实际的关系或者顺序。术语“包括”、“包含”或者其任何其他变体意在涵盖非排他性的包含，从而使得包括一系列要素的过程、方法、物品或者设备不仅包括那些要素，而且还包括没有明确列出的其他要素，或者是还包括为这种过程、方法、物品或者设备所固有的要素。在没有更多限制的情况下，由语句“包括一个……”限定的要素，并不排除在包括所述要素的过程、方法、物品或者设备中还存在另外的相同要素。
以上所述，仅为本发明的具体实施方式，但本发明的保护范围并不局限于此，任何熟悉本技术领域的技术人员在本发明揭露的技术范围内，可轻易想到变化或替换，都应涵盖在本发明的保护范围之内。因此，本发明的保护范围应以所述权利要求的保护范围为准。

Claims (15)

  1. 一种推荐用户信息的方法，包括：
    接收第一用户的消费券的标识；
    根据所述消费券的标识，获取对应的门店标识；
    根据所述门店标识，确定第二用户；
    获取所述第二用户的用户信息，将所述第二用户的用户信息推荐给所述第一用户。
  2. 根据权利要求1所述的方法，其中，所述根据所述消费券的标识，获取对应的门店标识，包括：
    获取已存储的消费券列表；
    根据所述消费券的标识，从所述消费券列表中查询所述消费券对应的门店标识。
  3. 根据权利要求1所述的方法，其中，所述根据所述门店标识，确定第二用户，包括：
    根据所述门店标识，调取所述门店标识对应的门店关联列表；
    从所述门店关联列表中，按照所述第一用户对应的自定义规则确定对应的第二用户。
  4. 根据权利要求3所述的方法，其中，所述方法还包括：
    根据所述消费券的标识，确定所述消费券对应的消费券金额；
    根据所述消费券金额及预设单次推荐额度，确定所述第一用户对应的推荐次数；
    根据所述第一用户的用户标识、所述门店标识及所述推荐次数，生成所述第一用户对应的门店关联信息；
    将所述第一用户对应的门店关联信息存储在所述门店标识对应的门店关联列表中。
  5. 根据权利要求4所述的方法，还包括：
    在所述门店标识对应的门店关联列表中，对所述第二用户对应的门店关联信息中的推荐次数进行减一操作；
    判断减一操作后所述第二用户对应的推荐次数是否为0，如果是，则从所述门店关联列表中删除所述第二用户对应的门店关联信息。
  6. 根据权利要求1所述的方法，其中，所述获取所述第二用户的用户信息，将所述第二用户的用户信息推荐给所述第一用户，包括：
    获取所述第二用户的用户标识及所述第二用户对应的历史门店信息；
    根据所述第二用户的用户标识及所述历史门店信息，生成所述第二用户的用户信息；
    向所述第一用户发送所述第二用户的用户信息及预设展示方式，所述预设展示方式包括翻牌动画方式或波纹渐变动画方式。
  7. 根据权利要求1所述的方法，还包括：
    确定所述第二用户的当前位置，
    当确定所述第二用户的当前位置为所述门店标识对应的门店时，发送偶遇提示信息给所述第一用户及所述第二用户。
  8. 一种推荐用户信息的装置，包括处理器，所述处理器通过读取存储介质上所存储的与推荐用户信息的控制逻辑对应的机器可读指令并执行所述指令来：
    接收第一用户的消费券的标识；
    根据所述消费券的标识，获取对应的门店标识；
    根据所述门店标识，确定第二用户；
    获取所述第二用户的用户信息，将所述第二用户的用户信息推荐给所述第一用户。
  9. 根据权利要求8所述的装置，其中，当根据所述消费券的标识，获取对应的门店标识时，所述机器可读指令促使所述处理器：
    获取已存储的消费券列表；
    根据所述消费券的标识，从所述消费券列表中查询所述消费券对应的门店标识。
  10. 根据权利要求8所述的装置，其中，当根据所述门店标识，确定第二用户时，所述机器可读指令促使所述处理器：
    根据所述门店标识，调取所述门店标识对应的门店关联列表；
    从所述门店关联列表中，按照所述第一用户对应的自定义规则确定对应的第二用户。
  11. 根据权利要求10所述的装置，其中，所述机器可读指令促使所述处理器：
    根据所述消费券的标识，确定所述消费券对应的消费券金额；
    根据所述消费券金额及预设单次推荐额度，确定所述第一用户对应的推荐次数；
    根据所述第一用户的用户标识、所述门店标识及所述推荐次数，生成所述第一用户对应 的门店关联信息；
    将所述第一用户对应的门店关联信息存储在所述门店标识对应的门店关联列表中。
  12. 根据权利要求11所述的装置，其中，所述机器可读指令促使所述处理器：
    在所述门店标识对应的门店关联列表中，对所述第二用户对应的门店关联信息中的推荐次数进行减一操作；
    判断减一操作后所述第二用户对应的推荐次数是否为0，如果是，则从所述门店关联列表中删除所述第二用户对应的门店关联信息。
  13. 根据权利要求8所述的装置，其中，当获取所述第二用户的用户信息，将所述第二用户的用户信息推荐给所述第一用户时，所述机器可读指令促使所述处理器：
    获取所述第二用户的用户标识及所述第二用户对应的历史门店信息；
    根据所述第二用户的用户标识及所述历史门店信息，生成所述第二用户的用户信息；
    向所述第一用户发送所述第二用户的用户信息及预设展示方式，所述预设展示方式包括翻牌动画方式或波纹渐变动画方式。
  14. 根据权利要求8所述的装置，其中，所述机器可读指令促使所述处理器：
    确定所述第二用户的当前位置，
    当确定所述第二用户的当前位置为所述门店标识对应的门店时，发送偶遇提示信息给所述第一用户及所述第二用户。
  15. 一种机器可读存储介质，存储由一个或多个处理器执行的机器可读指令，所述机器可读指令促使所述处理器执行如权利要求1-7所述的推荐用户信息的方法。
PCT/CN2017/071979 2016-01-22 2017-01-20 用户信息推荐 Ceased WO2017125083A1 (zh)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US16/071,549 US10937047B2 (en) 2016-01-22 2017-01-20 Recommending user information

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610046826.0A CN105741131A (zh) 2016-01-22 2016-01-22 一种推荐用户信息的方法及装置
CN201610046826.0 2016-01-22

Publications (1)

Publication Number Publication Date
WO2017125083A1 true WO2017125083A1 (zh) 2017-07-27

Family

ID=56247351

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/071979 Ceased WO2017125083A1 (zh) 2016-01-22 2017-01-20 用户信息推荐

Country Status (3)

Country Link
US (1) US10937047B2 (zh)
CN (1) CN105741131A (zh)
WO (1) WO2017125083A1 (zh)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105741131A (zh) 2016-01-22 2016-07-06 北京三快在线科技有限公司 一种推荐用户信息的方法及装置
CN106682968B (zh) * 2017-01-10 2021-07-02 北京三快在线科技有限公司 导航菜单的生成方法、装置及服务器
CN110909250B (zh) * 2018-09-14 2023-05-02 阿里巴巴集团控股有限公司 信息处理方法及装置、存储介质、处理器
CN110020867B (zh) * 2019-01-30 2023-07-14 创新先进技术有限公司 一种消费合约的处理方法、装置和设备
CN111768260A (zh) * 2019-09-11 2020-10-13 北京京东尚科信息技术有限公司 推荐同兴趣用户的方法、装置及设备
CN112579876A (zh) * 2019-09-30 2021-03-30 北京京东尚科信息技术有限公司 基于用户兴趣的信息推送方法、装置、系统及存储介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103327045A (zh) * 2012-03-21 2013-09-25 腾讯科技（深圳）有限公司 社交网络中的用户推荐方法和系统
CN103810192A (zh) * 2012-11-09 2014-05-21 腾讯科技（深圳）有限公司 一种用户的兴趣推荐方法和装置
CN104572937A (zh) * 2014-12-30 2015-04-29 杭州云象网络技术有限公司 一种基于室内生活圈的线下好友推荐方法
CN105208068A (zh) * 2014-06-26 2015-12-30 中兴通讯股份有限公司 一种推送黄页信息的方法及黄页服务器
CN105741131A (zh) * 2016-01-22 2016-07-06 北京三快在线科技有限公司 一种推荐用户信息的方法及装置

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070265921A1 (en) * 2006-05-01 2007-11-15 Nebraska Book Company Hierarchical referral system
US8229458B2 (en) * 2007-04-08 2012-07-24 Enhanced Geographic Llc Systems and methods to determine the name of a location visited by a user of a wireless device
US20100125490A1 (en) * 2008-11-14 2010-05-20 Microsoft Corporation Social network referral coupons
US10497022B2 (en) * 2012-01-20 2019-12-03 Visa International Service Association Systems and methods to present and process offers
CN103077490A (zh) * 2013-01-29 2013-05-01 阿坝师范高等专科学校 旅游消费信息的数据处理方法
CN105096151A (zh) * 2014-05-15 2015-11-25 中国移动通信集团公司 信息推荐方法及装置、服务器
CN104881802A (zh) * 2015-06-26 2015-09-02 深圳市华阳信通科技发展有限公司 智能装置及其关联推荐商品的方法

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103327045A (zh) * 2012-03-21 2013-09-25 腾讯科技（深圳）有限公司 社交网络中的用户推荐方法和系统
CN103810192A (zh) * 2012-11-09 2014-05-21 腾讯科技（深圳）有限公司 一种用户的兴趣推荐方法和装置
CN105208068A (zh) * 2014-06-26 2015-12-30 中兴通讯股份有限公司 一种推送黄页信息的方法及黄页服务器
CN104572937A (zh) * 2014-12-30 2015-04-29 杭州云象网络技术有限公司 一种基于室内生活圈的线下好友推荐方法
CN105741131A (zh) * 2016-01-22 2016-07-06 北京三快在线科技有限公司 一种推荐用户信息的方法及装置

Also Published As

Publication number Publication date
CN105741131A (zh) 2016-07-06
US20190026766A1 (en) 2019-01-24
US10937047B2 (en) 2021-03-02

Similar Documents

Publication Publication Date Title
US9792618B1 (en) Delivering promotions associated with user profiles through multiple digital channels associated with the user profiles
US10074109B2 (en) Propagating promotional information on a social network
JP6578364B2 (ja) ソーシャル・ネットワーキング・システムを介した業者とのユーザ通信
WO2017125083A1 (zh) 用户信息推荐
US20200219152A1 (en) Systems for Integrating Online Reviews with Point of Sale (POS) OR EPOS (Electronic Point of Sale) System
US20150181383A1 (en) Location-based messages
US20130013404A1 (en) System and method for distribution of digital offers
US10187331B1 (en) Determining user information from automated replies
US20080154697A1 (en) Like-Minded People Proximity Detection and Interest Matching System
KR20100003102A (ko) 개인 맞춤형 상품 정보를 제공하는 방법 및 장치
US20190266550A1 (en) Address Exchange Systems and Methods
US20150066807A1 (en) System and method of providing a virtual guestbook
US20130204708A1 (en) Providing targeted offers based on dynamic attributes of users
US20160005084A1 (en) Systems, methods, and computer program products for user-specific product related activity
US11605045B2 (en) Address exchange systems and methods
AU2019231140B2 (en) Address exchange systems and methods
US20190197464A1 (en) Address Exchange Systems and Methods
US11455592B2 (en) Systems and methods for facilitating interactive scenarios based on user parameters
US20080294736A1 (en) Electronic Mail Identification System
CN106790522B (zh) 对象推荐方法、装置和电商平台服务器
EP2720183A1 (en) Method and system for negotiating group offers while maintaining privacy of consumers
US20130254017A1 (en) System for influencing the buying preferences of users
CN116051201B (zh) 语音外呼数据的处理方法、装置、电子设备及存储介质
US20140081807A1 (en) Automated shipping address provision for gift giving processes including private label service
WO2019100572A1 (zh) 基于区块链的拼餐方法及装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 17741114

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 17741114

Country of ref document: EP

Kind code of ref document: A1