Methods and apparatus for targeting communications using social network metrics
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
G06F-015/16
H04L-012/58
G06Q-010/10
G06Q-020/14
H04L-012/18
G06F-017/30
G06F-003/0481
H04L-029/06
출원번호
US-0235367
(2016-08-12)
등록번호
US-9807047
(2017-10-31)
발명자
/ 주소
Lawler, Brian
Loh, Elliot
Martino, Paul J.
Pincus, Mark
출원인 / 주소
LinkedIn Corporation
대리인 / 주소
Schwegman Lundberg & Woessner, P.A.
인용정보
피인용 횟수 :
2인용 특허 :
17
초록▼
A method for a computer system includes receiving a first user communication, determining a first group of users, determining a target number of users, determining whether the first group of users includes the target number of users, and if not, providing the communication to the first group of user
A method for a computer system includes receiving a first user communication, determining a first group of users, determining a target number of users, determining whether the first group of users includes the target number of users, and if not, providing the communication to the first group of users, determining a hierarchal mapping of groups of users in response to user memberships, determining a second group of users from the hierarchal mapping, determining a plurality of social network relationship factors for the second group of users with respect to the first user, and providing the communication to at least a subset of users in the second group of users in response to the first plurality of social network relationship factors.
대표청구항▼
1. A method for automated prioritization of electronic communications transmitted over a network, the method comprising: receiving, on a server using an interface communicatively coupled to the network, an electronic communication directed to a first user of a social network from a second user of th
1. A method for automated prioritization of electronic communications transmitted over a network, the method comprising: receiving, on a server using an interface communicatively coupled to the network, an electronic communication directed to a first user of a social network from a second user of the social network, the social network including affinity groups configured within the social network;determining, using one or more processors within the server, a user network of the first user within the social network, the user network of the first user including users and affinity groups that are within a predetermined social distance from the first user;determining if the second user is within the user network of the first user; andprioritizing presentation of the electronic communication, relative to a plurality of other electronic communications for the first user, based at least in part on the determining if the second user is within the user network of the first user. 2. The method of claim 1, wherein prioritizing presentation of the electronic communication further includes: enabling the presentation of the electronic communication to the first user when the second user is within the user network of the first user; andblocking the presentation of the electronic communication to the first user when the second user is not within the user network of the first user. 3. The method of claim 1, further comprising: constraining information searches requested by the first user to information from users within the user network of the first user. 4. The method of claim 1, further comprising: imputing relationships of users within each affinity group to the respective affinity group for calculating distances between affinity groups and for calculating distances between users and affinity groups. 5. The method of claim 4, wherein the second user is within the user network of the first user further when: a social distance between the first user and the second user is less than or equal to the predetermined social distance; ora social distance between affinity groups of the first user and affinity groups of the second user is less than or equal to the predetermined social distance. 6. The method of claim 4, further comprising: determining a taxonomy for related affinity groups based on common user membership overlap. 7. The method of claim 1, further comprising: identifying implied affinity group s for the first user, wherein an implied affinity group includes users that share a common expressed interest, wherein the implied affinity groups for the first user are included within the user network of the first user;identifying implied affinity group s for the second user; andwherein determining if the second user is within the user network of the first user includes the implied affinity groups. 8. The method of claim 1, further comprising: determining a trust-network metric associated with the second user, wherein prioritizing presentation of the electronic communication includes weighting the trust-network metric associated with the second user in comparison to trust-network metrics associated with the plurality of other electronic communications for the first user. 9. The method claim 1, wherein prioritizing presentation of the electronic communication includes storing the electronic communication in a folder associated with an affinity group connection between the first user and the second user. 10. A system comprising: a network interface;a memory device; anda processor communicatively coupled to the memory device, wherein the processor, the memory device, and the network interface cooperate such that the system performs operations comprising: receiving, on the network interface, an electronic communication directed to a first user of a social network from a second user of the social network, the social network including affinity groups configured within the social network;determining, by the processor, a user network of the first user within the social network, the user network of the first user including users and affinity groups that are within a predetermined social distance from the first user;determining if the second user is within the user network of the first user; andprioritizing presentation of the electronic communication, relative to a plurality of other electronic communications for the first user, based at least in part on the determining if the second user is within the user network of the first user. 11. The system of claim 10, wherein prioritizing presentation of the electronic communication further includes: enabling the presentation of the electronic communication to the first user when the second user is within the user network of the first user; andblocking the presentation of the electronic communication to the first user when the second user is not within the user network of the first user. 12. The system of claim 10, wherein the operations further comprise: constraining information searches requested by the first user to information from users within the user network of the first user. 13. The system of claim 10, wherein the operations further comprise: imputing relationships of users within each affinity group to the respective affinity group for calculating distances between affinity groups and for calculating distances between users and affinity groups. 14. The system of claim 13, wherein the second user is within the user network of the first user further when: a social distance between the first user and the second user is less than or equal to the predetermined social distance; ora social distance between affinity groups of the first user and affinity groups of the second user is less than or equal to the predetermined social distance. 15. The system of claim 13, wherein the operations further comprise: determining a taxonomy for related affinity groups based on common user membership overlap. 16. The system of claim 10, wherein the operations further comprise: identifying implied affinity groups for the first user, wherein an implied affinity group includes users that share a common expressed interest, wherein the implied affinity groups for the first user are included within the user network of the first user;identifying implied affinity groups for the second user; andwherein determining if the second user is within the user network of the first user includes the implied affinity groups. 17. The system of claim 10, wherein the operations further comprise: determining a trust-network metric associated with the second user, wherein prioritizing presentation of the electronic communication includes weighting the trust-network metric associated with the second user in comparison to trust-network metrics associated with the plurality of other electronic communications for the first user. 18. A non-transitory computer-readable medium including instructions for automated prioritization of electronic communications transmitted over a network that, when executed on a computing device including one or more processors, cause the computing device to perform operations comprising: receiving, on a server using an interface communicatively coupled to the network, an electronic communication directed to a first user of a social network from a second user of the social network, the social network including affinity groups configured within the social network;determining, using one or more processors within the server, a user network of the first user within the social network, the user network of the first user including users and affinity groups that are within a predetermined social distance from the first user;determining if the second user is within the user network of the first user; andprioritizing presentation of the electronic communication, relative to a plurality of other electronic communications for the first user, based at least in part on the determining if the second user is within the user network of the first user. 19. The computer-readable medium of claim 18, wherein prioritizing presentation of the electronic communication further includes: enabling the presentation of the electronic communication to the first user when the second user is within the user network of the first user; andblocking the presentation of the electronic communication to the first user when the second user is not within the user network of the first user. 20. The computer-readable medium of claim 18, wherein the operations further comprise: constraining information searches requested by the first user to information from users within the user network of the first user. 21. The computer-readable medium of claim 18, wherein the operations further comprise: imputing relationships of users within each affinity group to the respective affinity group for calculating distances between affinity groups and for calculating distances between users and affinity groups. 22. The computer-readable medium of claim 21, wherein the second user is within the user network of the first user further when: a social distance between the first user and the second user is less than or equal to the predetermined social distance; ora social distance between affinity groups of the first user and affinity groups of the second user is less than or equal to the predetermined social distance. 23. The computer-readable medium of claim 21, wherein the operations further comprise: determining a taxonomy for related affinity groups based on common user membership overlap. 24. The computer-readable medium of claim 18, wherein the operations further comprise: identifying implied affinity groups for the first user, wherein an implied affinity group includes users that share a common expressed interest, wherein the implied affinity groups for the first user are included within the user network of the first user;identifying implied affinity groups for the second user; andwherein determining if the second user is within the user network of the first user includes the implied affinity groups. 25. The computer-readable medium of claim 18, wherein the operations further comprise: determining a trust-network metric associated with the second user, wherein prioritizing presentation of the electronic communication includes weighting the trust-network metric associated with the second user in comparison to trust-network metrics associated with the plurality of other electronic communications for the first user.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (17)
Wilkins, Jeffrey Kohl; Zoken, Jack Marshall, Internet-enabled lead generation.
Weinreich Andrew P. ; Salamon Mark R. ; Zilberberg Shoshana ; Berlyn Nicole D. ; Mitchell Leeann ; Rosen Cliff ; Seifer Adam ; Green Justin ; Haber David ; Samuels David ; Chibnik Ron ; Clifford Scot, Method and apparatus for constructing a networking database and system.
Smiga, Brian; Buchheim, Dennis; Hagan, Thomas; Wadhwani, David; Storkel, Norman Scott, Method and apparatus for group action processing between users of a collaboration system.
Colyer, Wallace; Bhat, Tapan; DiFatta, III, Charles; Stubenvoll, David J.; Zhen, Fangyao, Method and apparatus for mapping a community through user interactions on a computer network.
Kreiner Barrett Morris ; Litwin Edward Paul, Method and system for processing a memory map to provide listing information representing data within a database.
Farnham,Shelly D.; Turski,Andrzej; Portnoy,William L.; Vronay,David P.; Cheng,Lili, Social mapping of contacts from computer communication information.
Abrams,Jonathan H., System, method and apparatus for connecting users in an online computer system based on their relationships within social networks.
Shear Victor H. ; Van Wie David M. ; Weber Robert P., Systems and methods for matching, selecting, narrowcasting, and/or classifying based on rights management and/or other information.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.