IP Library Granted Patent US 8,635,281
Granted Patent B2
US 8,635,281 · App. 12/973,296 · Granted Jan 21, 2014

System and method for attentive clustering and analytics

Inventor: John W. Kelly (New York, NY)
Assignee: Morningside Analytics, Inc.
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,635,281
App. No.
12/973,296
Granted
Jan 21, 2014
Kind
B2
Abstract

Attentive clustering includes constructing an online author network, wherein constructing includes selecting a set of source nodes (S), a set of outlink targets (T) from a selected type or types of hyperlinks, and a set of edges (E) between S and T defined by the selected hyperlinks, constructing a matrix of source nodes in S linked to targets in T′, wherein T′ is derived by normalizing nodes in T, and partitioning the network into at least one set of source nodes with a similar linking history to form an attentive cluster and at least one set of outlink targets with a similar citation profile to form an outlink bundle. Attentive clustering may further include applying any lists specifying inclusion or exclusion of particular nodes. Frequencies of links between attentive clusters and outlink bundles may be measured and analyzed.

Claims (41)

1. A method, comprising:

constructing an online author network, wherein constructing the online author network comprises selecting a set of source nodes (S), a set of outlink targets (T), and a set of edges (E) between S and T defined by the at least one selected type of hyperlink from S to T during a specified time period;

deriving a set of nodes, T′, by normalizing nodes in T;

transforming the online author network into a matrix of source nodes in S linked to targets in T′;

partitioning the online author network into at least one set of source nodes with a similar linking history to form an attentive cluster and at least one set of outlink targets with a similar citation profile to form an outlink bundle;

generating a graphical representation of attentive clusters and/or outlink bundles in the network to enable interpretation of network features and behavior and calculation of comparative statistical measures across the attentive clusters and outlink bundles,

wherein at least one element of the graphical representation depicts a measure of an extent of a type of activity within the network; and

measuring frequencies of links between attentive clusters and outlink bundles enabling identification and measurement of large-scale regularities in the distribution of attention by online authors across sources of information.

2. The method of claim 1 , wherein the element of the graphical representation uses at least one of size, thickness, color and pattern to depict a type of activity.

3. The method of claim 1 , wherein attentive clusters are differentiated in the graphical representation by at least one of a color, a shape, a shading, and a size.

4. The method of claim 1 , wherein the size of the element representing the attentive clusters in the graphical representation correlates with a metric.

5. The method of claim 1 , wherein the nodes, targets, and edges are collected from public and private sources of information.

6. The method of claim 1 , wherein constructing the matrix comprises applying at least one threshold parameter from the group consisting of: maxnodes, targetmax, nodemin, targetmin, maxlinks, and linkmin.

7. The method of claim 1 , wherein constructing the matrix comprises applying a minimum threshold for the number of included nodes that must link to a target to qualify it for inclusion in the matrix.

8. The method of claim 1 , wherein constructing the matrix comprises applying a minimum threshold for the number of included targets that must link to a node to qualify it for inclusion in the matrix.

9. The method of claim 1 , wherein the matrix is a graph matrix.

10. The method of claim 1 , wherein the nodes are normalized to a selected level of abstraction.

11. The method of claim 1 , wherein the set of outlink targets (T) are selected from at least one selected type of hyperlink.

12. The method of claim 1 , wherein the set of source nodes (S) are selected from at least one selected type of node.

13. The method of claim 1 , further comprising, applying any lists specifying inclusion or exclusion of particular nodes.

14. A method, comprising:

constructing an online author network, wherein constructing the online author network comprises selecting a set of source nodes (S), a set of outlink targets (T), and a set of edges (E) between S and T defined by the at least one selected type of hyperlink from S to T during a specified time period;

deriving a set of nodes, T′, by normalizing nodes in T;

transforming the online author network into a matrix of source nodes in S linked to targets in T′;

partitioning the online author network into at least one set of source nodes with a similar linking history to form an attentive cluster and at least one set of outlink targets with a similar citation profile to form an outlink bundle; and

measuring frequencies of links between attentive clusters and outlink bundles enabling identification and measurement of large-scale regularities in the distribution of attention by online authors across sources of information.

15. The method of claim 14 , further comprising:

generating a graphical representation of attentive clusters and/or outlink bundles in the network to enable interpretation of network features and behavior and calculation of comparative statistical measures across the attentive clusters and outlink bundles,

wherein at least one element of the graphical representation depicts a measure of an extent of a type of activity within the network.

16. The method of claim 14 , wherein the set of outlink targets (T) are selected from at least one selected type of hyperlink.

17. The method of claim 14 , wherein the set of source nodes (S) are selected from at least one selected type of node.

18. The method of claim 14 , wherein the nodes are normalized to a selected level of abstraction.

19. The method of claim 14 , further comprising, applying any lists specifying inclusion or exclusion of particular nodes.

20. A method of attentive clustering, comprising:

defining at least one semantic bundle; and

calculating relevance scores for nodes based on that bundle; and

selecting a subset of nodes based in whole or in part on the relevance scores; and

partitioning an online author network of the subset into at least one set of source nodes with a similar linking history to form an attentive cluster and at least one set of outlink targets with a similar citation profile to form an outlink bundle.

21. A method, comprising:

partitioning an online author network into at least one set of source nodes with a similar linking history to form an attentive cluster and at least one set of outlink targets with a similar citation profile to form an outlink bundle;

generating a graphical representation of link targets, semantic events, and node-associated metadata scattered in an x-y coordinate space, wherein the dimensions of the graph are custom-defined using sets of attentive clusters grouped to represent substantive dimensions of interest for a particular analysis.

Assignments (5)
SECURITY INTEREST Recorded May 5, 2025
From: GRAPHIKA TECHNOLOGIES, INC.
To: WESTERN ALLIANCE BANK
Reel/Frame 071020/0536 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 27, 2024
From: OCTANT DATA, LLC
To: GRAPHIKA TECHNOLOGIES, INC.
Reel/Frame 066920/0855 →
CHANGE OF NAME Recorded Mar 27, 2024
From: GRAPHIKA, INC.
To: OCTANT DATA, LLC
Reel/Frame 066925/0048 →
CHANGE OF NAME Recorded Feb 10, 2015
From: MORNINGSIDE ANALYTICS, INC.
To: GRAPHIKA, INC.
Reel/Frame 034926/0060 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 21, 2010
From: KELLY, JOHN W.
To: MORNINGSIDE ANALYTICS, INC.
Reel/Frame 025539/0001 →
Continuity (2)
Provisional Application 61287766 · Dec 18, 2009
Related Publication 20110173264A1 · Jul 14, 2011