Extremal Ensemble Learning
Extremal Ensemble Learning (EEL) is a machine learning algorithmic paradigm for graph partitioning. EEL creates an ensemble of partitions and then uses information contained in the ensemble to find new and improved partitions. The ensemble evolves and learns how to form improved partitions through extremal updating procedure. The final solution is found by achieving consensus among its member partitions about what the optimal partition is.[1][2]
Reduced Network Extremal Ensemble Learning (RenEEL)
A particular implementation of the EEL paradigm is the Reduced Network Extremal Ensemble Learning (RenEEL) scheme for partitioning a graph.[1] RenEEL uses consensus across many partitions in an ensemble to create a reduced network that can be efficiently analyzed to find more accurate partitions. These better quality partitions are subsequently used to update the ensemble. An algorithm that utilizes the RenEEL scheme is currently the best algorithm for finding the graph partition with maximum modularity, which is an NP-hard problem.[3]
References
- ↑ 1.0 1.1 J. Guo; P. Singh; K.E. Bassler (2019). "Reduced network extremal ensemble learning (RenEEL) scheme for community detection in complex networks". Scientific Reports 9 (14234): 14234. doi:10.1038/s41598-019-50739-3. PMID 31578406. Bibcode: 2019NatSR...914234G.
- ↑ Polikar, R. (2006). "Ensemble based systems in decision making". IEEE Circuits and Systems Magazine 6 (3): 21–45. doi:10.1109/MCAS.2006.1688199.
- ↑ Newman, M. E. J. (2006). "Modularity and community structure in networks". Proceedings of the National Academy of Sciences of the United States of America 103 (23): 8577–8696. doi:10.1073/pnas.0601602103. PMID 16723398. Bibcode: 2006PNAS..103.8577N.
 |  |
