Authors:
Joseph E. Johnson
and
John William Campbell
Affiliation:
University of South Carolina, United States
Keyword(s):
Cluster Identification, Network Series Expansions, Renyi Entropy Spectra, Markov Type Lie Group, Continuous Groups, Lie Group.
Related
Ontology
Subjects/Areas/Topics:
Artificial Intelligence
;
Business Analytics
;
Clustering and Classification Methods
;
Data Analytics
;
Data Engineering
;
Knowledge Discovery and Information Retrieval
;
Knowledge-Based Systems
;
Mining High-Dimensional Data
;
Soft Computing
;
Symbolic Systems
;
Web Mining
Abstract:
The author proved that the continuous general linear (Lie) group in n dimensions can be decomposed into (a) a Markov type Lie group (MTLG) preserving the sum of the components of a vector, and (b) an Abelian Lie scaling group that scales each of the components. For a specific Lie basis, the MTLG generated all continuous Markov transformations (a Lie Markov Monoid LMM) and in subsequently published work, proved that every possible network as defined by an n x n connection matrix Cij of non-negative off-diagonal real numbers was isomorphic to the set of LMM. As this defined the diagonal of C, it supported full eigenvalue analysis of the generated Markov Matrix as well as support of Renyi entropies whose spectra ordered the nodes and make comparison of networks now possible. Our new research provides (a) a method of expanding a network topology in different orders of Renyi entropies, (b) the construction of a meta-network of all possible networks of use in network classification, (c)
the use of eigenvector analysis of the LMM generated by a network C to provide an agnostic methodology for identifying clusters and (d) an a methodology for identifying clusters in general numeric database tables.
(More)