An Alternating Algorithm for Mining Redescriptions: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 14:5714:57, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,454 bytes +1,454‎ Created page with "Title: An Alternating Algorithm for Mining Redescriptions Research Question: How can we develop a novel algorithm to find subsets of data that can be described in multiple ways, also known as redescriptions? Methodology: The researchers introduced a new data mining task called redescription mining and proposed a novel tree-based algorithm called CARTwheels for this task. CARTwheels is an alternating algorithm that grows two trees in opposite directions, matching their..."
Retrieved from "https://simplesci.org/wiki/An_Alternating_Algorithm_for_Mining_Redescriptions"