
doi: 10.3390/a5040654
A zero-suppressed binary decision diagram (ZDD) is a graph representation suitable for handling sparse set families. Given a ZDD representing a set family, we present an efficient algorithm to discover a hidden structure, called a co-occurrence relation, on the ground set. This computation can be done in time complexity that is related not to the number of sets, but to some feature values of the ZDD. We furthermore introduce a conditional co-occurrence relation and present an extraction algorithm, which enables us to discover further structural information.
Data structures, Industrial engineering. Management engineering, Learning and adaptive systems in artificial intelligence, QA75.5-76.95, data mining, T55.4-60.8, partition, ZDD, Electronic computers. Computer science, co-occurrence, Nonnumerical algorithms, BDD
Data structures, Industrial engineering. Management engineering, Learning and adaptive systems in artificial intelligence, QA75.5-76.95, data mining, T55.4-60.8, partition, ZDD, Electronic computers. Computer science, co-occurrence, Nonnumerical algorithms, BDD
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
