arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0311048cs.CEcs.AI
收藏

旋转CARTwheels:一种挖掘重描述的交替算法

Turning CARTwheels: An Alternating Algorithm for Mining Redescriptions

Deept Kumar, Naren Ramakrishnan, Malcolm Potts, Richard F. Helm

摘要:

我们提出了一个不寻常的算法,涉及分类树,两棵树生长在相反的方向,使他们在他们的叶子相匹配。这种方法在一个新的数据采掘任务中找到了应用,我们制定,称为“重新描述挖掘”。重描述是一种词汇的转换,或者是一种不同的方式来传达关于给定数据子集的信息;重描述挖掘的目标是找到提供多个描述的数据子集。我们强调了这个问题在生物信息学等领域的重要性,这些领域表现出数据描述符的潜在丰富性和多样性(例如,基因可以通过多种方式进行研究)。我们的方法有助于集成多种形式的特征数据集,将从一个数据集获得的知识置于其他数据集的上下文中,并利用高级抽象来揭示数据的神秘和微妙特征。算法设计决策,实施细节,和实验结果。

英文摘要:

We present an unusual algorithm involving classification trees where two trees are grown in opposite directions so that they are matched at their leaves. This approach finds application in a new data mining task we formulate, called "redescription mining". A redescription is a shift-of-vocabulary, or a different way of communicating information about a given subset of data; the goal of redescription mining is to find subsets of data that afford multiple descriptions. We highlight the importance of this problem in domains such as bioinformatics, which exhibit an underlying richness and diversity of data descriptors (e.g., genes can be studied in a variety of ways). Our approach helps integrate multiple forms of characterizing datasets, situates the knowledge gained from one dataset in the context of others, and harnesses high-level abstractions for uncovering cryptic and subtle features of data. Algorithm design decisions, implementation details, and experimental results are presented.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑