用不确定数据包络分析进行分类
Classifying with Uncertain Data Envelopment Analysis
摘要:
分类将实体组织到类别中,这些类别识别类别内的相似性并辨别类别之间的差异,并且它们有力地对信息进行分类以支持分析。我们提出了一个新的分类方案,基于不完美数据的现实。我们的计算模型使用不确定的数据分析来定义一个分类的接近公平的效率,这是一个分类的类别内的内部相似性的总措施。我们的分类过程有两个压倒一切的计算挑战,这些是一个损失的凸性和组合爆炸性的搜索空间。我们克服了第一个建立下限和上界的邻近值,然后通过搜索这个范围内的一阶算法。我们克服了第二个适应的p-中位数问题,开始我们的探索,然后采用迭代邻域搜索,以完成分类。最后,我们将道琼斯工业平均指数中的30只股票分为业绩等级,并将前列腺治疗分为临床有效类别。
英文摘要:
Classifications organize entities into categories that identify similarities within a category and discern dissimilarities among categories, and they powerfully classify information in support of analysis. We propose a new classification scheme premised on the reality of imperfect data. Our computational model uses uncertain data envelopment analysis to define a classification's proximity to equitable efficiency, which is an aggregate measure of intra-similarity within a classification's categories. Our classification process has two overriding computational challenges, those being a loss of convexity and a combinatorially explosive search space. We overcome the first by establishing lower and upper bounds on the proximity value, and then by searching this range with a first-order algorithm. We overcome the second by adapting the p-median problem to initiate our exploration, and by then employing an iterative neighborhood search to finalize a classification. We conclude by classifying the thirty stocks in the Dow Jones Industrial average into performant tiers and by classifying prostate treatments into clinically effectual categories.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。