English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 56562/90363 (63%)
造访人次 : 11854578      在线人数 : 120
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻

    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/50396

    题名: Mining marketing maps for business alliances
    作者: 廖述賢;Liao, Shu-hsien;Chang, Wen-jung;Lee, Chai-chen
    贡献者: 淡江大學經營決策學系
    关键词: Business alliance;Marketing maps;Database marketing;Data mining;Association rules;Knowledge extraction
    日期: 2008-10
    上传时间: 2010-08-09 16:44:38 (UTC+8)
    出版者: Oxford: Pergamon
    摘要: A business can strengthen its competitive advantage and increase its market share by forming a strategic alliance. With the help of alliances, businesses can bring to bear significant resources beyond the capabilities of the individual co-operating firms. Thus how to effectively evaluate and select alliance partners is an important task for businesses because a successful corporation partner selection can therefore reduce the possible risk and avoid failure results on business alliance. This paper proposes the Apriori algorithm as a methodology of association rules for data mining, which is implemented for mining marketing map knowledge from customers. Knowledge extraction from marketing maps is illustrated as knowledge patterns and rules in order to propose suggestions for business alliances and possible co-operation solutions. Finally, this study suggests that integration of different research factors, variables, theories, and methods for investigating this research topic of business alliance could improve research results and scope.
    關聯: Expert Systems with Applications 35(3), pp.1338-1350
    DOI: 10.1016/j.eswa.2007.08.052
    显示于类别:[管理科學學系暨研究所] 期刊論文


    档案 大小格式浏览次数
    0957-4174_35(3)p1338-1350.pdf842KbAdobe PDF221检视/开启



    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回馈