Seriation using tree-penalized path length

European Journal of Operational Research（2023）

引用 0|浏览5

暂无评分

摘要

•Tree-penalized path length (tpPL) is a new hybrid data seriation method.•tpPL minimizes path length while staying close to a given tree structure.•tpPL orderings have shorter path length than orderings from optimal leaf order.•tpPL keeps well-defined clusters intact, unlike traveling salesman problem ordering.•tpPL method can be implemented in O(n2) time using existing TSP heuristics.

查看译文

关键词

Combinatorial optimization,Linear orderings,Optimal leaf ordering,Tree penalized distance,TSP

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要