## Description A phylomemetic network (or phylomemy) is an adaptation of the concept of the phylogenetic tree, combined with Richard Dawkins' intuition of a meme, to describe the complex dynamic structure of transformation of relations between terms. This package is a partial implementation of some noteworthy algorithms composed to compute a phylomemy, in order to understand and test them. ## Clustering ### Linear time Closed itemset Miner (LCM) Based upon: - « HLCM: a first experiment on parallel data mining with Haskell ». By Alexandre Termier & Benjamin Négrevergne & Simon Marlow & Satnam Singh From the original LCM algorithm from Takaki Uno and Hiroki Arimura. ### Maximal clique TODO ## Temporal matching #### Maximal spanning forest > If the order in which edges will be deleted is known ahead of time, then we > can solve the dynamic connectivity problem in time `O(log n)` per query. If > we can maintain a maximum spanning forest where edges are ordered by their > deletion time, we know that when we delete some edge that is in the forest, > there is no possible edge that can replace it. If there were some edge that > connects the same two components the deleted edge does, then this other edge > would have been part of the maximum spanning forest instead of the edge we > deleted. This makes the delete operation trivial: we simply need to split the > tree into its two parts if the edge to delete is part of our forest, or > ignore the operation otherwise. https://en.wikipedia.org/wiki/Dynamic_connectivity#Offline_dynamic_connectivity ## Acknowledgements Based upon: - Chavalarias D & Cointet J-P (2013). « Phylomemetic Patterns in Science Evolution—The Rise and Fall of Scientific Fields ». PLoS ONE 8(2): e54847. - Chavalarias, D. & Lobbé, Q. & Delanoë, A. (2021). « Draw me Science: Multi-level and multi-scale reconstruction of knowledge dynamics with phylomemies ». Scientometrics.