Evolving Large-Scale Data Stream Analytics based on Scalable PANFIS

Many distributed machine learning frameworks have recently been built to speed up the large-scale data learning process. However, most distributed machine learning used in these frameworks still uses an offline algorithm model which cannot cope with the data stream problems. In fact, large-scale data are mostly generated by the non-stationary data stream where its pattern evolves over time. To address this problem, we propose a novel Evolving Large-scale Data Stream Analytics framework based on a Scalable Parsimonious Network based on Fuzzy Inference System (Scalable PANFIS), where the PANFIS evolving algorithm is distributed over the worker nodes in the cloud to learn large-scale data stream. Scalable PANFIS framework incorporates the active learning (AL) strategy and two model fusion methods. The AL accelerates the distributed learning process to generate an initial evolving large-scale data stream model (initial model), whereas the two model fusion methods aggregate an initial model to generate the final model. The final model represents the update of current large-scale data knowledge which can be used to infer future data. Extensive experiments on this framework are validated by measuring the accuracy and running time of four combinations of Scalable PANFIS and other Spark-based built in algorithms. The results indicate that Scalable PANFIS with AL improves the training time to be almost two times faster than Scalable PANFIS without AL. The results also show both rule merging and the voting mechanisms yield similar accuracy in general among Scalable PANFIS algorithms and they are generally better than Spark-based algorithms. In terms of running time, the Scalable PANFIS training time outperforms all Spark-based algorithms when classifying numerous benchmark datasets.Comment: 20 pages, 5 figure

Statistical equilibrium of tetrahedra from maximum entropy principle

Discrete formulations of (quantum) gravity in four spacetime dimensions build space out of tetrahedra. We investigate a statistical mechanical system of tetrahedra from a many-body point of view based on non-local, combinatorial gluing constraints that are modelled as multi-particle interactions. We focus on Gibbs equilibrium states, constructed using Jaynes' principle of constrained maximisation of entropy, which has been shown recently to play an important role in characterising equilibrium in background independent systems. We apply this principle first to classical systems of many tetrahedra using different examples of geometrically motivated constraints. Then for a system of quantum tetrahedra, we show that the quantum statistical partition function of a Gibbs state with respect to some constraint operator can be reinterpreted as a partition function for a quantum field theory of tetrahedra, taking the form of a group field theory.Comment: v3 published version; v2 18 pages, 4 figures, improved text in sections IIIC & IVB, minor changes elsewher