%0 Journal Article
%T Research of maximal profit item selection problem<br>最大利润项集选择问题研究*
%A LIU Li-zhi
%A LIU Jun
%A XIE Chang-sheng
%A <br>刘黎志
%A 刘军
%A 谢长生
%J 计算机应用研究
%D 2008
%I 
%X Maximal profit item selection is an application based on association rule. Frequent item set reflects commodity sale is related. If some items are removed from the whole commodity set, especially which strongly related with other items, profit loss is inevitable because of commodity sale association is changed. Loss rule can computer how much profit is lost, so the profit of reserved item set can be computed exactly. To ensure the profit of reserved item set is maximal, reserved item set must be selected. Maximal profit item selection problem is a NP hard problem, it can be solved by a known quadratic programming which is NP complete.
%K maximal profit item
%K loss rule
%K quadratic programming
%K association rule<br>最大利润项集
%K 丢失规则
%K 二次规划
%K 关联规则
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=5A07BE064AA93259657930BD4B43116E&yid=67289AFF6305E306&vid=C5154311167311FE&iid=0B39A22176CE99FB&sid=375BEEEA164CFE59&eid=31125890FF093250&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=5