<s>
Extremal	B-Algorithm
Ensemble	I-Algorithm
Learning	I-Algorithm
(	O
EEL	O
)	O
is	O
a	O
machine	O
learning	O
algorithmic	O
paradigm	O
for	O
graph	O
partitioning	O
.	O
</s>
<s>
EEL	O
creates	O
an	O
ensemble	B-Algorithm
of	O
partitions	O
and	O
then	O
uses	O
information	O
contained	O
in	O
the	O
ensemble	B-Algorithm
to	O
find	O
new	O
and	O
improved	O
partitions	O
.	O
</s>
<s>
The	O
ensemble	B-Algorithm
evolves	O
and	O
learns	O
how	O
to	O
form	O
improved	O
partitions	O
through	O
extremal	O
updating	O
procedure	O
.	O
</s>
<s>
The	O
final	O
solution	O
is	O
found	O
by	O
achieving	O
consensus	B-Operating_System
among	O
its	O
member	O
partitions	O
about	O
what	O
the	O
optimal	O
partition	O
is	O
.	O
</s>
<s>
A	O
particular	O
implementation	O
of	O
the	O
EEL	O
paradigm	O
is	O
the	O
Reduced	O
Network	O
Extremal	B-Algorithm
Ensemble	I-Algorithm
Learning	I-Algorithm
(	O
RenEEL	O
)	O
scheme	O
for	O
partitioning	O
a	O
graph	O
.	O
</s>
<s>
RenEEL	O
uses	O
consensus	B-Operating_System
across	O
many	O
partitions	O
in	O
an	O
ensemble	B-Algorithm
to	O
create	O
a	O
reduced	O
network	O
that	O
can	O
be	O
efficiently	O
analyzed	O
to	O
find	O
more	O
accurate	O
partitions	O
.	O
</s>
<s>
These	O
better	O
quality	O
partitions	O
are	O
subsequently	O
used	O
to	O
update	O
the	O
ensemble	B-Algorithm
.	O
</s>
