US20090248709A1 - Evaluating Associations Among Entities - Google Patents
Evaluating Associations Among Entities Download PDF
determined based
Oded Fuhrmann
Dan Pelleg
International Business Machines Corp
2008-03-26 Application filed by International Business Machines Corp filed Critical International Business Machines Corp
2008-03-26 Priority to US12/055,330 priority Critical patent/US20090248709A1/en
2008-03-26 Assigned to INTERNATIONAL BUSINESS MACHINES CORPORATION reassignment INTERNATIONAL BUSINESS MACHINES CORPORATION ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: FUHRMANN, ODED, PELLEG, DAN
230000003993 interaction Effects 0 description 12
230000015654 memory Effects 0 description 11
238000005065 mining Methods 0 description 2
230000003542 behavioural Effects 0 description 1
238000007405 data analysis Methods 0 description 1
238000007418 data mining Methods 0 description 1
230000002035 prolonged Effects 0 description 1
230000003997 social interaction Effects 0 description 1
G06Q10/00—Administration; Management
G06Q10/10—Office automation, e.g. computer aided management of electronic mail or groupware; Time management, e.g. calendars, reminders, meetings or time accounting
G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
G06Q50/01—Social networking
A method for monitoring associations between a plurality of entities comprises representing a relationship between a first entity and a second entity as an edge that connects a first node to a second node, wherein the first node and the second node respectively represent said first entity and said second entity; and assigning a weight value to said edge based on an association level detected between the first entity and the second entity.
COPYRIGHT AND TRADEMARK NOTICES
A portion of the disclosure of this patent document contains material which is subject to copyright protection. The owner has no objection to the facsimile reproduction by any one of the patent document or the patent disclosure as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyrights whatsoever.
Certain marks referenced herein may be common law or registered trademarks of third parties affiliated or unaffiliated with the applicant or the assignee. Use of these marks is for providing an enabling disclosure by way of example and shall not be construed to limit the scope of this invention to material associated with such marks.
The present invention relates generally to a network of associated entities and, more particularly, to systems and methods for monitoring or evaluating the strength of associations between such entities.
The analysis of the nature of relationships and associations between various entities in different networks or groups is the subject of many socio-economical studies. The results of such studies can be used to determine behavioral habits and activity patterns for the involved entities and groups. To be efficient and effective, studies conducted in real world environments are generally limited to certain target groups and sample subjects within each group. With the advent of virtual worlds (i.e., computer generated graphical environments), many social groups and relationships in the real world may be successfully implemented.
For example, entities can be represented by avatars (i.e., software generated agents) in virtual environments, typically in the form of graphically rendered images, icons, characters or other visual manifestations of controllable objects (e.g., graphically presentable life forms). Such virtual worlds may be used to analyze real world relationships and associations in more manageable ways. Currently, however, no systems or methods are available that can monitor the association between avatars in a virtual environment and the counterpart entities in the real world in a truly meaningful way.
Methods and systems are needed that can overcome the above problems.
The present disclosure is directed to systems, methods and corresponding products that facilitate monitoring or evaluating the strength of associations between entities or groups in a network.
For purposes of summarizing, certain aspects, advantages, and novel features of the invention have been described herein. It is to be understood that not all such advantages may be achieved in accordance with any one particular embodiment of the invention. Thus, the invention may be embodied or carried out in a manner that achieves or optimizes one advantage or group of advantages without achieving all advantages as may be taught or suggested herein.
In accordance with one embodiment, a method for monitoring associations between a plurality of entities comprises representing a relationship between a first entity and a second entity as an edge that connects a first node to a second node, wherein the first node and the second node respectively represent said first entity and said second entity; and assigning a weight to said edge based on an association level detected between the first entity and the second entity.
The association level and type may be determined based on various factors such as the level of activity or communication between the first and second entities, the number of common resources or objects available to both the first entity and the second entity, the number of common environments or groups visited or joined by both entities, the number of related objects associated with both entities, or the number of related activities and environments in which the entities participate.
One or more of the above-disclosed embodiments in addition to certain alternatives are provided in further detail below with reference to the attached figures. The invention is not, however, limited to any particular embodiment disclosed.
Embodiments of the present invention are understood by referring to the figures in the attached drawings, as provided below.
FIG. 1 illustrates an exemplary virtual environment in accordance with one or more embodiments, wherein interactions between a plurality of entities are monitored.
FIG. 2 is a flow diagram of a method for monitoring interactions between a plurality of entities, in accordance with one embodiment.
FIGS. 3 and 4 and are block diagrams of hardware and software environments in which a system of the present invention may operate, in accordance with one or more embodiments.
Features, elements, and aspects of the invention that are referenced by the same numerals in different figures represent the same, equivalent, or similar features, elements, or aspects, in accordance with one or more embodiments.
DETAILED DESCRIPTION OF THE EXEMPLARY EMBODIMENTS
The present disclosure is directed to systems and corresponding methods that facilitate monitoring interaction between a plurality of entities. For each entity, data is collected about the entity's interactions with other entities. A network of connected nodes is maintained based on a detected association between said entities, wherein each node represents an entity and the weight of an edge connecting two nodes represents the level of interaction between those nodes.
In the following, numerous specific details are set forth to provide a thorough description of various embodiments of the invention. Certain embodiments of the invention may be practiced without these specific details or with some variations in detail. In some instances, certain features are described in less detail so as not to obscure other aspects of the invention. The level of detail associated with each of the elements or features should not be construed to qualify the novelty or importance of one feature over the others.
In accordance with one aspect of the invention, a network may be implemented as a structure that defines the association of entities or groups in relation to each other. Nodes in the graph may be used to represent entities such as locations, organizations, peoples, groups and their roles or attributes. Edges may be used to connect the nodes together to indicate an association or a relationship between the connected nodes. Strength of the connection between the nodes may be represented by a value (e.g., a weight) and possibly a tupe assigned to the respective edge.
In accordance with one embodiment, a method for monitoring associations between a plurality of entities in a network comprises representing a relationship between a first entity and a second entity as an edge that connects a first node to a second node, wherein the first node and the second node respectively represent said first entity and said second entity; and assigning a weight value and possibly a type to said edge based on an association level detected between the first entity and the second entity. As an alternative to setting multiple values for multiple types, the same information may be encoded as a vector of values for the edge.
The association level may be determined based on various factors such as the level of activity or communication between the first and second entities, the number of common resources or objects available to both the first entity and the second entity, the number of common environments or groups visited or joined by both entities, the number of related objects associated with both entities, or the number of related activities and environments in which the entities participate. The edge weights may also provide an association type, such that one weight may provide a measure of friendship, dislike or business collaboration between two entities, for example.
The monitored entities or environments may be either virtual or real, depending on implementation. Referring to FIG. 1, an exemplary virtual environment 100 is illustrated. The virtual environment may be implemented using logic code (e.g., software) loaded onto one or more computing systems connected by way of an electronic communication network (e.g., the Internet). In accordance with one aspect of the system, the virtual environment 100 supports an environment in which one or more software applications can be executed on top of one or more operating systems to instantiate or create virtual objects that represent a node in the virtual environment 100.
As shown in FIG. 1, nodes 110 through 140 represent different entities in virtual environment 100. For example, node 110 may represent a male participant in a social network, while node 120 may represent a female participant. A node may be also assigned certain attributes. Nodes 110 and 120 may, for example, be assigned attributes 112 and 122 respectively. The attributes may provide detailed information about each node, such as name, location, information about the associated nodes, and any other details available for the node.
A node's information may be used by simulators, scripts, and objects to track an entity's location, activities and interactions with other entities. For example, the activities of entities represented by nodes 110 and 120 may be tracked to determine whether an association may be established in the form of an edge between nodes 110 and 120. An edge may represent, for example, a social interaction, a business relationship or a commercial activity between the entities in the network.
In an exemplary scenario, the entities represented by nodes 110 and 120 may have visited an entity or establishment (e.g., a restaurant) represented by node 140. The association with node 140 may be represented by an edge A connecting nodes 140 and 120, and an edge E connecting nodes 140 and 110. In some embodiments, an additional edge B may connect nodes 110 and 120 as a representation that nodes 110 and 120 have a common interest in node 140 (e.g., they have both visited a common entity).
In another embodiment, edge B may represent that the entities represented by nodes 110 and 120 may have met at a location represented by node 140, or alternatively that they didn't meet but were at a certain location at the same time, for example, or that they have expressed a common interest in said location by joining a group associated with that location, etc. One can appreciate that other types of associations and relationships may be also represented by edges connecting different nodes. For example, an edge between node 120 and node 130 may represent that the entity represented by node 120 owns the entity (e.g., house) represented by node 130.
Referring to FIGS. 1 and 2, in certain embodiments, level of interaction between the entities is monitored (S210). Depending on the level of interaction, a certain weight may be assigned to an edge representing an association between two nodes. For example, as shown in FIG. 1, edge E connecting nodes 110 and 140 has a greater weight than edge A connecting nodes 120 and 140 to indicate that, for example, the entity represented by node 110 has visited location represented by node 140 more frequently than the entity represented by node 120. Similarly, edge D has a greater weight than edge C, indicating for example that the entity represented by node 120 more frequently visits location represented by node 130, than entity represented by node 110.
Referring back to FIG. 2, if it is determined that the level of interaction between two nodes has changed (S220), the association level or the strength of a relationship between two nodes (e.g., represented by the weight of an edge connecting the two nodes) may be adjusted (S230). For example, as shown in FIG. 1, if the entity represented by node 110 does not visit the entity represented by node 120 (at node 130 representing, for example, a house owned by node 120), as frequently, then the weight of edge C connecting node 110 to node 130 may be reduced. If the level of inactivity between nodes 110 and 130 (or nodes 110 and 120) continues or is prolonged beyond a threshold, then edge C may be completely removed.
Depending on implementation, a history of the level of activity for one node or the level of interaction between the nodes may be stored in a database either separately or, for example, as a part of the attributes associated with each node. Accordingly, it would be possible to analyze the activity level of a node or interactivity level between multiple nodes throughout a certain time period. That is, the data stored for each node, desirably including the node's attributes, along with the association between the nodes and the strength of each association can be tracked in time to discern habits and patterns of activity for various nodes or their corresponding entities, groups or establishments represented by other nodes.
In some embodiments, a social networking graph may be generated by special software applications configured to collect data about one or more nodes, using various social network mining tools. For example, presence of a new entity may be detected when a corresponding node is added to the social network. As discussed earlier, if two entities either visit the same location, spend time in the same location, participate in the same type of activity, chat with each other, or the like, the software application causes the weight of the corresponding edges in the social network to be increased.
In some embodiments, data may be collected and analyzed using existing social network mining tools or a standard web log analyzer. The data may be then used to determine best means for product placement at a certain location, the number of visitors, the best time of day or week for such placement, or the number of visitors who come back within a certain time threshold to visit the same location.
The location and identity of an entity may be continuously monitored to determine certain habits or patterns for the particular entity. In some embodiments, the monitoring comprises tracking the locations visited by each entity by way of, for example, logging that entity's identification information in association with the visited location. Based on the recorded data a periodic report may be generated to report the type and level of activity by an entity, the entities associated with a target entity, the type and level of interaction between certain entities, etc.
Depending on implementation and types of data analysis and data mining tools utilized, various statistics may be generated based on the recorded data and the reports. The statistics based on that activity may include time of day distribution, day of week distribution, visit duration, or number of repeat visits. In some embodiments, to avoid over logging or over analysis, multiple logs referring to the same identification information for an entity during a certain time frame (e.g., a short time line) may be construed as a single visit.
In some embodiments, a presence map may be generated based on detected level of activity for one or more entities in a certain location; generating statistical reports based on the level of activity. A map may be also generated based on said statistics. Color coding schemes may be used to designate high/low presence or high/low traffic locations based on the level of activity, the type of activity, or other statistical factors that may be important to a researcher or analyst.
The color coding scheme may be utilized to represent, for example, the number of entities or the amount of time a particular entity spends in one or more locations, such that the intensity of a color or a mark is increased or decreased according to an increase or decrease in the number of entities or the duration of their stay in a certain location. Similar or other types of coding or identification schemes may be used to represent locations which attract visitors for particular time durations.
In one embodiment, the tools, schemes and patterns discussed above with reference to a virtual environment 100 may be utilized and applied to a real world environment, where certain interactions and activities by certain individuals may be monitored. For example, a real life office environment is very similar to a virtual environment, from a simulation or verification standpoint, and therefore can be monitored in accordance with the same schemes and concepts disclosed earlier.
By way of example, individuals working in an office interact and associate with members of a particular social network (i.e., employees of an enterprise) according to a set of rules (i.e., work etiquette and office rules). Such individuals are also typically confined within structural limitations (i.e., office space) and interface via specific means of communication (e.g., electronic networks, email, telephone, etc.) according to a predefined time schedule. Thus, many activities or interactivities of each individual can be taken into account based on the content of the individual's communication (e.g., email correspondence) with others. The time and location of certain activities may be also monitored.
Accordingly, each individual noted above may be represented by a node; one or more edges can be used to define that individual's associations (and the strength of each association) with other individuals or entities in the social network. Similar interests among individuals can be determined based on the content of their communication, the type of content they access (e.g., over the internet), or the files that they own or share over a communication network. As such, it can be seen that the conceptual schemes discussed with respect to a virtual environment may be equally applied to real-life subjects. It is noteworthy of course, that one or more embodiments may be implemented within the confines of the law as related to individual privacy rights and subject to the consent of the individuals involved where appropriate.
In different embodiments, the invention can be implemented either entirely in the form of hardware or entirely in the form of software, or a combination of both hardware and software elements. For example software utilized to implement one or more aspects of the above system may comprise a controlled computing system environment that can be presented largely in terms of hardware components and software code executed to perform processes that achieve the results contemplated by the system of the present invention.
Referring to FIGS. 3 and 4, a computing system environment in accordance with an exemplary embodiment is composed of a hardware environment 400 and a software environment 500. The hardware environment 400 comprises the machinery and equipment that provide an execution environment for the software; and the software provides the execution instructions for the hardware as provided below.
As provided here, the software elements that are executed on the illustrated hardware elements are described in terms of specific logical/functional relationships. It should be noted, however, that the respective methods implemented in software may be also implemented in hardware by way of configured and programmed processors, ASICs (application specific integrated circuits), FPGAs (Field Programmable Gate Arrays) and DSPs (digital signal processors), for example.
Software environment 500 is divided into two major classes comprising system software 502 and application software 504. System software 502 comprises control programs, such as the operating system (OS) and information management systems that instruct the hardware how to function and process information.
In one embodiment, software for implementing the novel concepts discussed here may be implemented as system software 502 and application software 504 executed on one or more hardware environments to facilitate memory sharing among computing systems in network 130. Application software 504 may comprise but is not limited to program code, data structures, firmware, resident software, microcode or any other form of information or routine that may be read, analyzed or executed by a microcontroller.
In an alternative embodiment, the invention may be implemented as computer program product accessible from a computer-usable or computer-readable medium providing program code for use by or in connection with a computer or any instruction execution system. For the purposes of this description, a computer-usable or computer-readable medium can be any apparatus that can contain, store, communicate, propagate or transport the program for use by or in connection with the instruction execution system, apparatus or device.
The computer-readable medium can be an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system (or apparatus or device) or a propagation medium. Examples of a computer-readable medium include a semiconductor or solid-state memory, magnetic tape, a removable computer diskette, a random access memory (RAM), a read-only memory (ROM), a rigid magnetic disk and an optical disk. Current examples of optical disks include compact disk read only memory (CD-ROM), compact disk read/write (CD-R/W) and digital videodisk (DVD).
Referring to FIG. 3, an embodiment of the system software 502 and application software 504 can be implemented as computer software in the form of computer readable code executed on a data processing system such as hardware environment 400 that comprises a processor 402 coupled to one or more computer readable media or memory elements by way of a system bus 404. The computer readable media or the memory elements, for example, can comprise local memory 406, storage media 408, and cache memory 410. Processor 402 loads executable code from storage media 408 to local memory 406. Cache memory 410 provides temporary storage to reduce the number of times code is loaded from storage media 408 for execution.
A user interface device 412 (e.g., keyboard, pointing device, etc.) and a display screen 414 can be coupled to the computing system either directly or through an intervening I/O controller 416, for example. A communication interface unit 418, such as a network adapter, may be also coupled to the computing system to enable the data processing system to communicate with other data processing systems or remote printers or storage devices through intervening private or public networks. Wired or wireless modems and Ethernet cards are a few of the exemplary types of network adapters.
In one or more embodiments, hardware environment 400 may not include all the above components, or may comprise other components for additional functionality or utility. For example, hardware environment 400 may be a laptop computer or other portable computing device embodied in an embedded system such as a set-top box, a personal data assistant (PDA), a mobile communication unit (e.g., a wireless phone), or other similar hardware platforms that have information processing and/or data storage and communication capabilities.
In certain embodiments of the system, communication interface 418 communicates with other systems by sending and receiving electrical, electromagnetic or optical signals that carry digital data streams representing various types of information including program code. The communication may be established by way of a remote network (e.g., the Internet), or alternatively by way of transmission over a carrier wave.
Referring to FIG. 4, system software 502 and application software 504 can comprise one or more computer programs that are executed on top of operating system 112 after being loaded from storage media 408 into local memory 406. In a client-server architecture, application software 504 may comprise client software and server software. For example, in one embodiment of the invention, client software is executed on computing systems 110 or 120 and server software is executed on a server system (not shown).
Software environment 500 may also comprise browser software 508 for accessing data available over local or remote computing networks. Further, software environment 500 may comprise a user interface 506 (e.g., a Graphical User Interface (GUI)) for receiving user commands and data. Please note that the hardware and software architectures and environments described above are for purposes of example, and one or more embodiments of the invention may be implemented over any type of system architecture or processing environment.
It should also be understood that the logic code, programs, modules, processes, methods and the order in which the respective steps of each method are performed are purely exemplary. Depending on implementation, the steps may be performed in any order or in parallel, unless indicated otherwise in the present disclosure. Further, the logic code is not related, or limited to any particular programming language, and may comprise of one or more modules that execute on one or more processors in a distributed, non-distributed or multiprocessing environment.
Therefore, it should be understood that the invention can be practiced with modification and alteration within the spirit and scope of the appended claims. The description is not intended to be exhaustive or to limit the invention to the precise form disclosed. These and various other adaptations and combinations of the embodiments disclosed are within the scope of the invention and are further defined by the claims and their full scope of equivalents.
1. A method comprising:
representing a relationship between a first entity and a second entity as an edge that connects a first node to a second node, wherein the first node and the second node respectively represent said first entity and said second entity; and
assigning a weight value or type to said edge based on an association level detected between the first entity and the second entity.
2. The method of claim 1, wherein the association level is determined based on level of activity between the first and second entities.
3. The method of claim 1, wherein the level of activity is determined based on level of communication between the first and second entities.
4. The method of claim 1, wherein the association level is determined based on number of common resources available to both the first entity and the second entity.
5. The method of claim 1, wherein the association level is determined based on number of common objects associated with both the first entity and the second entity.
6. The method of claim 1, wherein the association level is determined based on number of common environments visited by both the first entity and the second entity.
7. The method of claim 1, wherein the association level is determined based on number of common groups joined by both the first entity and the second entity.
8. The method of claim 1, wherein the association level is determined based on number of related objects associated with both the first entity and the second entity.
9. The method of claim 1, wherein the association level is determined based on number of related activities in which both the first entity and the second entity participate.
10. The method of claim 1, wherein the association level is determined based on number of related environments which both the first entity and the second entity visit.
11. A system comprising:
logic unit to represent a relationship between a first entity and a second entity as an edge that connects a first node to a second node, wherein the first node and the second node respectively represent said first entity and said second entity; and
logic unit to assign a weight value or type to said edge based on an association level detected between the first entity and the second entity.
12. The system of claim 11, wherein the association level is determined based on level of activity between the first and second entities.
13. The system of claim 11, wherein the level of activity is determined based on level of communication between the first and second entities.
14. The system of claim 11, wherein the association level is determined based on number of common resources available to both the first entity and the second entity.
15. The system of claim 11, wherein the association level is determined based on number of common objects associated with both the first entity and the second entity.
16. A computer usable storage medium with logic code stored thereon, wherein execution of the logic code by a microcontroller causes a computing system to:
represent a relationship between a first entity and a second entity as an edge that connects a first node to a second node, wherein the first node and the second node respectively represent said first entity and said second entity; and
assign a weight value or type to said edge based on an association level detected between the first entity and the second entity.
17. The computer usable storage medium of claim 16, wherein the association level is determined based on level of activity between the first and second entities.
18. The computer usable storage medium of claim 16, wherein the level of activity is determined based on level of communication between the first and second entities.
19. The computer usable storage medium of claim 16, wherein the association level is determined based on number of common resources available to both the first entity and the second entity.
20. The computer usable storage medium of claim 16, wherein the association level is determined based on number of common objects associated with both the first entity and the second entity.
US12/055,330 2008-03-26 2008-03-26 Evaluating Associations Among Entities Abandoned US20090248709A1 (en)
US12/055,330 US20090248709A1 (en) 2008-03-26 2008-03-26 Evaluating Associations Among Entities
US12/055,330 Abandoned US20090248709A1 (en) 2008-03-26 2008-03-26 Evaluating Associations Among Entities
US20090319914A1 (en) * 2008-06-23 2009-12-24 Microsoft Corporation Assessing relationship between participants in online community
US20100198633A1 (en) * 2009-02-03 2010-08-05 Ido Guy Method and System for Obtaining Social Network Information
US20100251158A1 (en) * 2009-03-30 2010-09-30 Avaya Inc. System and method for graphically managing communication sessions
US20110016114A1 (en) * 2009-07-17 2011-01-20 Thomas Bradley Allen Probabilistic link strength reduction
US20110105143A1 (en) * 2009-11-03 2011-05-05 Geosolutions B.V. Proximal relevancy ranking in a layered linked node database
WO2012091846A3 (en) * 2010-12-30 2012-08-30 Facebook, Inc. Distributed cache for graph data
WO2012141910A1 (en) * 2011-04-15 2012-10-18 Facebook, Inc. Display showing intersection between users of a social networking system
US20130138741A1 (en) * 2010-08-18 2013-05-30 Joshua Redstone Location ranking using social graph information
US20140149501A1 (en) * 2012-11-27 2014-05-29 Wayne Kao Efficient Navigation Through Social Networking Content
US20140172903A1 (en) * 2012-12-14 2014-06-19 Hewlett-Packard Development Company, L.P. Relevance map linking
US20140278770A1 (en) * 2013-03-13 2014-09-18 International Business Machines Corporation Generating economic model based on business transaction messages
US9165327B1 (en) * 2008-12-27 2015-10-20 Apple Inc. Method and apparatus for managing business and social contacts
US20160110476A1 (en) * 2013-05-31 2016-04-21 Kyoto University Relationship graph interlinkage system
AU2016200251B2 (en) * 2010-12-30 2016-04-28 Facebook, Inc. Distributed cache for graph data
US20170188101A1 (en) * 2015-12-28 2017-06-29 Verizon Patent And Licensing Inc. Hebbian learning-based recommendations for social networks
US20170286565A1 (en) * 2011-06-23 2017-10-05 FullContact, Inc. Relationship graph
US20020138607A1 (en) * 2001-03-22 2002-09-26 There System, method and computer program product for data mining in a three-dimensional multi-user environment
US6801930B1 (en) * 2000-02-26 2004-10-05 Quazal Technologies Inc. Method and apparatus for maintaining information about users sharing the cells partitioning a computer-generated environment
US6801229B1 (en) * 2001-04-06 2004-10-05 Plumbdesign System for creation of visual representation of data
US7133883B2 (en) * 2002-12-23 2006-11-07 Sun Microsystems, Inc. General techniques for diagnosing data corruptions
US7155441B2 (en) * 2000-07-11 2006-12-26 Sony Corporation Fuzzy relations and graph structures for compact description and modification
US20070149288A1 (en) * 2005-12-28 2007-06-28 Palo Alto Research Center Incorporated Method, apparatus, and program product for clustering entities in a persistent virtual environment
US20070192356A1 (en) * 2006-01-31 2007-08-16 O'kelley Charles Brian Open media exchange platforms
US7302439B2 (en) * 2002-06-28 2007-11-27 Sun Microsystems, Inc. Information model mapping with shared directory tree representations
US20070299872A1 (en) * 2006-06-27 2007-12-27 Palo Alto Research Center Method, Apparatus, And Program Product For Developing And Maintaining A Comprehension State Of A Collection Of Information
US20080183695A1 (en) * 2007-01-31 2008-07-31 Yahoo! Inc. Using activation paths to cluster proximity query results
US7512612B1 (en) * 2002-08-08 2009-03-31 Spoke Software Selecting an optimal path through a relationship graph
US7539697B1 (en) * 2002-08-08 2009-05-26 Spoke Software Creation and maintenance of social relationship network graphs
US9344396B2 (en) 2009-03-30 2016-05-17 Avaya Inc. System and method for persistent multimedia conferencing services
US20100246800A1 (en) * 2009-03-30 2010-09-30 Avaya Inc. System and method for managing a contact center with a graphical call connection metaphor
US20100246571A1 (en) * 2009-03-30 2010-09-30 Avaya Inc. System and method for managing multiple concurrent communication sessions using a graphical call connection metaphor
US20100251177A1 (en) * 2009-03-30 2010-09-30 Avaya Inc. System and method for graphically managing a communication session with a context based contact set
US20100251119A1 (en) * 2009-03-30 2010-09-30 Avaya Inc. System and method for managing incoming requests for a communication session using a graphical connection metaphor
US20100251127A1 (en) * 2009-03-30 2010-09-30 Avaya Inc. System and method for managing trusted relationships in communication sessions using a graphical metaphor
US20150135098A1 (en) * 2009-03-30 2015-05-14 Avaya Inc. System and method for mode-neutral communications with a widget-based communications metaphor
JP2011041247A (en) * 2009-03-30 2011-02-24 Avaya Inc System and method for managing trusted relationship in communication session using graphical metaphor
US8938677B2 (en) 2009-03-30 2015-01-20 Avaya Inc. System and method for mode-neutral communications with a widget-based communications metaphor
US9325661B2 (en) 2009-03-30 2016-04-26 Avaya Inc. System and method for managing a contact center with a graphical call connection metaphor
US9900280B2 (en) 2009-03-30 2018-02-20 Avaya Inc. System and method for managing incoming requests for a communication session using a graphical connection metaphor
US10108616B2 (en) * 2009-07-17 2018-10-23 International Business Machines Corporation Probabilistic link strength reduction
US20170070871A1 (en) * 2010-08-18 2017-03-09 Facebook, Inc. Location ranking using social graph information
US9924336B2 (en) * 2010-08-18 2018-03-20 Facebook, Inc. Location ranking using social graph information
US9767152B2 (en) 2010-12-30 2017-09-19 Facebook, Inc. Distributed cache for graph data
US9208207B2 (en) * 2010-12-30 2015-12-08 Facebook, Inc. Distributed cache for graph data
US8438364B2 (en) 2010-12-30 2013-05-07 Facebook Inc. Distributed cache for graph data
US8954675B2 (en) 2010-12-30 2015-02-10 Facebook, Inc. Distribution cache for graph data
JP2014501416A (en) * 2010-12-30 2014-01-20 フェイスブック,インク. Distributed cache of graph data
US20160085879A1 (en) * 2011-04-15 2016-03-24 Facebook, Inc. Display showing intersection between users of a social networking system
US10042952B2 (en) * 2011-04-15 2018-08-07 Facebook, Inc. Display showing intersection between users of a social networking system
US9235863B2 (en) * 2011-04-15 2016-01-12 Facebook, Inc. Display showing intersection between users of a social networking system
US10445371B2 (en) * 2011-06-23 2019-10-15 FullContact, Inc. Relationship graph
US9361401B2 (en) * 2012-12-14 2016-06-07 Hewlett Packard Enterprise Development Lp Relevance map linking
US10362137B2 (en) * 2015-12-28 2019-07-23 Verizon Patent And Licensing Inc. Hebbian learning-based recommendations for social networks
Sutcliffe et al. 2013 Requirements elicitation: Towards the unknown unknowns
Semrau et al. 2014 How exactly do network relationships pay off? The effects of network size and relationship quality on access to start–up resources
Santoro et al. 2018 The Internet of Things: Building a knowledge management system for open innovation and knowledge management capacity
Peristeras et al. 2000 Towards an enterprise architecture for public administration using a top-down approach
Andriole 2010 Business impact of Web 2.0 technologies
Hosseini et al. 2014 The four pillars of crowdsourcing: A reference model
Bose et al. 2011 Integrative framework for assessing firms' potential to undertake Green IT initiatives via virtualization–A theoretical perspective
McAfee 2009 Shattering the myths about Enterprise 2.0
Lindgren et al. 2008 Multi‐contextuality in boundary‐spanning practices
Vouzas et al. 2005 Best practices of selected Greek organizations on their road to business excellence: the contribution of the new ISO 9000: 2000 series of standards
Luoma-aho et al. 2010 Actor-networking stakeholder theory for today's corporate communications
Kim et al. 2012 Sociometric badges: Using sensor technology to capture new forms of collaboration
US20100070883A1 (en) 2010-03-18 Virtual universe subject matter expert assistance
Kam Sing Wong et al. 2012 The influence of market orientation on new product success
US20090030927A1 (en) 2009-01-29 Method and apparatus for managing organizational resources
US20140025734A1 (en) 2014-01-23 Dynamic Community Generation Based Upon Determined Trends Within a Social Software Environment
US20120290565A1 (en) 2012-11-15 Automatic social graph calculation
Delic et al. 2009 Enterprise knowledge clouds: Next generation KM systems?
EP2769352A1 (en) 2014-08-27 Performance data in a worker profile aggregated by a job distribution platform for workers that perform crowd sourced tasks
US8812342B2 (en) 2014-08-19 Managing and monitoring continuous improvement in detection of compliance violations
Carter et al. 2011 The emerging CIO role of business technology strategist.
Saldanha et al. 2012 Organizational adoption of web 2.0 technologies: An empirical analysis
Briggs et al. 2009 A seven-layer model of collaboration: Separation of concerns for designers of collaboration systems
McDonald-Madden et al. 2010 Active adaptive conservation of threatened species in the face of uncertainty
Motahari-Nezhad et al. 2013 Adaptive case management: Overview and research challenges
Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:FUHRMANN, ODED;PELLEG, DAN;REEL/FRAME:020700/0490