System and method for content-aware co-clustering algorithm based on hourglass model
First Claim
1. A method for performing a network operation, comprising:
- obtaining an association matrix having a plurality of columns corresponding to a plurality of first entities in the network and a plurality of rows corresponding to a plurality of second entities in the network, wherein an element of the association matrix in a column corresponding to a first entity of the plurality of the first entities and in a row corresponding to a second entity of the plurality of the second entities represents an association parameter between the first entity and the second entity;
generating a reduced matrix of the association matrix by aggregating the plurality of columns based on a pre-determined mapping from the plurality of the first entities into a plurality of representative entities, wherein an element of the reduced matrix in a column corresponding to a first representative entity of the plurality of the representative entities and in the row corresponding to the second entity of the plurality of the second entities represents an association parameter between the first representative entity and the second entity;
partitioning, using a processor of a computer, a set comprising the plurality of representative entities and the plurality of second entities into a plurality of intermediate co-clusters based on a first cohesiveness criterion associated with the reduced matrix;
wherein an intermediate co-cluster of the plurality of intermediate co-clusters comprises one or more representative entities of the plurality of representative entities and one or more second entities of the plurality of the second entities;
mapping the one or more representative entities to corresponding first entities within the plurality of first entities based on a reversal of the pre-determined mapping to generate an expanded intermediate co-cluster from the intermediate co-cluster;
wherein the expanded intermediate co-cluster comprises the corresponding first entities and the one or more second entities;
partitioning, using the processor of the computer, the expanded intermediate co-cluster into a plurality of final co-clusters based on a second cohesiveness criterion associated with the association matrix;
generating a profile of network activities based on the plurality of final co-clusters; and
performing the network operation based on the profile of the network activities.
2 Assignments
0 Petitions
Accused Products
Abstract
A method for performing a network operation is disclosed. The method includes obtaining an association matrix representing association parameters between first entities and second entities of the network, generating a reduced matrix of the association matrix by aggregating the first entities into a reduced number of representative entities, partitioning a set containing the representative entities and the second entities into intermediate co-clusters based on a reduced-matrix based cohesiveness criterion, generating an expanded intermediate co-cluster from an intermediate co-cluster, partitioning the expanded intermediate co-cluster into final co-clusters based on an association-matrix based cohesiveness criterion, generating a profile of network activities based on the final co-clusters, and performing the network operation based on the profile of the network activities.
25 Citations
24 Claims
-
1. A method for performing a network operation, comprising:
-
obtaining an association matrix having a plurality of columns corresponding to a plurality of first entities in the network and a plurality of rows corresponding to a plurality of second entities in the network, wherein an element of the association matrix in a column corresponding to a first entity of the plurality of the first entities and in a row corresponding to a second entity of the plurality of the second entities represents an association parameter between the first entity and the second entity; generating a reduced matrix of the association matrix by aggregating the plurality of columns based on a pre-determined mapping from the plurality of the first entities into a plurality of representative entities, wherein an element of the reduced matrix in a column corresponding to a first representative entity of the plurality of the representative entities and in the row corresponding to the second entity of the plurality of the second entities represents an association parameter between the first representative entity and the second entity; partitioning, using a processor of a computer, a set comprising the plurality of representative entities and the plurality of second entities into a plurality of intermediate co-clusters based on a first cohesiveness criterion associated with the reduced matrix;
wherein an intermediate co-cluster of the plurality of intermediate co-clusters comprises one or more representative entities of the plurality of representative entities and one or more second entities of the plurality of the second entities;mapping the one or more representative entities to corresponding first entities within the plurality of first entities based on a reversal of the pre-determined mapping to generate an expanded intermediate co-cluster from the intermediate co-cluster;
wherein the expanded intermediate co-cluster comprises the corresponding first entities and the one or more second entities;partitioning, using the processor of the computer, the expanded intermediate co-cluster into a plurality of final co-clusters based on a second cohesiveness criterion associated with the association matrix; generating a profile of network activities based on the plurality of final co-clusters; and performing the network operation based on the profile of the network activities. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A non-transitory computer readable medium, embodying instructions when executed by the computer to perform a network operation, the instructions comprising functionality for:
-
obtaining an association matrix having a plurality of columns corresponding to a plurality of first entities in the network and a plurality of rows corresponding to a plurality of second entities in the network, wherein an element of the association matrix in a column corresponding to a first entity of the plurality of the first entities and in a row corresponding to a second entity of the plurality of the second entities represents an association parameter between the first entity and the second entity; generating a reduced matrix of the association matrix by aggregating the plurality of columns based on a pre-determined mapping from the plurality of the first entities into a plurality of representative entities, wherein an element of the reduced matrix in a column corresponding to a first representative entity of the plurality of the representative entities and in the row corresponding to the second entity of the plurality of the second entities represents an association parameter between the first representative entity and the second entity; partitioning, using a processor of a computer, a set comprising the plurality of representative entities and the plurality of second entities into a plurality of intermediate co-clusters based on a first cohesiveness criterion associated with the reduced matrix;
wherein an intermediate co-cluster of the plurality of intermediate co-clusters comprises one or more representative entities of the plurality of representative entities and one or more second entities of the plurality of the second entities;mapping the one or more representative entities to corresponding first entities within the plurality of first entities based on a reversal of the pre-determined mapping to generate an expanded intermediate co-cluster from the intermediate co-cluster;
wherein the expanded intermediate co-cluster comprises the corresponding first entities and the one or more second entities;partitioning, using the processor of the computer, the expanded intermediate co-cluster into a plurality of final co-clusters based on a second cohesiveness criterion associated with the association matrix; generating a profile of network activities based on the plurality of final co-clusters; and performing the network operation based on the profile of the network activities. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16)
-
-
17. A system for performing a network operation, comprising:
-
a processor; and memory storing instructions when executed by the processor comprising functionalities for; obtaining an association matrix having a plurality of columns corresponding to a plurality of first entities in the network and a plurality of rows corresponding to a plurality of second entities in the network, wherein an element of the association matrix in a column corresponding to a first entity of the plurality of the first entities and in a row corresponding to a second entity of the plurality of the second entities represents an association parameter between the first entity and the second entity; generating a reduced matrix of the association matrix by aggregating the plurality of columns based on a pre-determined mapping from the plurality of the first entities into a plurality of representative entities, wherein an element of the reduced matrix in a column corresponding to a first representative entity of the plurality of the representative entities and in the row corresponding to the second entity of the plurality of the second entities represents an association parameter between the first representative entity and the second entity; partitioning, using a processor of a computer, a set comprising the plurality of representative entities and the plurality of second entities into a plurality of intermediate co-clusters based on a first cohesiveness criterion associated with the reduced matrix;
wherein an intermediate co-cluster of the plurality of intermediate co-clusters comprises one or more representative entities of the plurality of representative entities and one or more second entities of the plurality of the second entities;mapping the one or more representative entities to corresponding first entities within the plurality of first entities based on a reversal of the pre-determined mapping to generate an expanded intermediate co-cluster from the intermediate co-cluster;
wherein the expanded intermediate co-cluster comprises the corresponding first entities and the one or more second entities;partitioning, using the processor of the computer, the expanded intermediate co-cluster into a plurality of final co-clusters based on a second cohesiveness criterion associated with the association matrix; generating a profile of network activities based on the plurality of final co-clusters; and performing the network operation based on the profile of the network activities. - View Dependent Claims (18, 19, 20, 21, 22, 23, 24)
-
Specification