Multiple interest matchmaking in personal business networks

Details Multiple interest matchmaking in personal business networks Multiple interest matchmaking in personal business networks

2011-05-31

2011-05-31

Casler, Traci L (Department: 3629)

Data processing: financial, business practice, management, or co

Automated electrical financial or business practice or...

Social networking

C705S500000, C705S320000

Reexamination Certificate

active

07953673

ABSTRACT:
The present invention can increase the odds of choosing the right people for a team by considering their “rate of interest/knowledge” in multiple topics. Given a known contacts network, represented by nodes interconnected by links, several different sub-networks are identified within it, corresponding to different topics or areas of expertise required to a specific project. For each sub-network, there will be nodes with an associated grade, based on that person's knowledge/interest for the topic related to that sub-network. As such, each node/person receives a grade for each topic. Using these grades, a weight of each link between the nodes is calculated. This process is performed for every node for each topic and associated grade. After that, a superposition of all sub-networks is made and a multiple interest network is yielded.

REFERENCES:
patent: 6480885 (2002-11-01), Olivier
patent: 7167910 (2007-01-01), Farnham et al.
patent: 7275068 (2007-09-01), Huberman et al.
patent: 7325012 (2008-01-01), Nagy
patent: 7502825 (2009-03-01), Webb et al.
patent: 7672919 (2010-03-01), Becker
patent: 7752227 (2010-07-01), Childers et al.
patent: 2004/0088325 (2004-05-01), Elder et al.
patent: 2005/0171799 (2005-08-01), Hull et al.
patent: 2005/0201290 (2005-09-01), Vasudev et al.
patent: 2005/0267940 (2005-12-01), Galbreath et al.
patent: 2006/0200435 (2006-09-01), Flinn et al.
patent: 2006/0218225 (2006-09-01), Hee Voon et al.
patent: 2008/0034074 (2008-02-01), Becker
patent: WO 2006/040405 (2006-04-01), None
Agrawal et al., “Mining Newsgroups Using Networks Arising From Social Behavior,” May 20-24 2003, 7 pages, WWW2003, Budapest, Hungary.
Chang et al., “Browsing Newsgroups with a Social Network Analyzer,” Jul. 10-12, 2002, 6 pages, Proceedings from Sixth International Conference on Information Visualization, London, UK.
Xu et al, “Fighting organized crimes: using shortest-path algorithms to identify associations in criminal networks,” Dec. 2004, pp. 473-487, Decision Support Systems, vol. 38, Issue 3. Available online at www.sciencedirect.com.
Faloutsos et al., “Connection Subgraphs in Social Networks,” 12 pages, source: http://www.mccurley.org/papers/social.pdf.
Unknown, “StumbleUpon,” 3 pages, retrieved from http://www.slumbleupon.com on Dec. 26, 2007.

Affiliated with

Also associated with

Rating

Multiple interest matchmaking in personal business networks does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Multiple interest matchmaking in personal business networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multiple interest matchmaking in personal business networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2683976