English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 113311/144292 (79%)
Visitors : 50929030      Online Users : 1014
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 商學院 > 資訊管理學系 > 會議論文 >  Item 140.119/75340
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/75340


    Title: Multidimensional data mining for healthcare service portfolio management
    Authors: Chiang, Johannes K.;Huang, Sheng Yin
    姜國輝;黃聖尹
    Contributors: 資管系
    Keywords: Association patterns;CRM;Customer relationship management;Healthcare services;Information loss;Mining techniques;Multi-dimensional analysis;Multidimensional data;Data structures;Data warehouses;Financial data processing;Health care;Investments;Medical applications;Taxonomies;Data mining
    Date: 2013-01
    Issue Date: 2015-05-28 16:52:25 (UTC+8)
    Abstract: Data Mining is one of the most significant tools for discovering association patterns that are useful in for health services, Customer Relationship Management (CRM) etc. Yet, there are some drawbacks in conventional mining techniques. Since most of them perform the plain mining based on predefined schemata through the data warehouse as a whole, a re-scan must be done whenever new attributes are added. Secondly, an association rule may be true on a certain granularity but fail on a smaller one and vise verse. Last but not least, they are usually designed specifically to find either frequent or infrequent rules. With regard to healthcare service management, this research aims at providing a novel data schema and an algorithm to solve the aforementioned problems. A forest of concept taxonomies is used as the data structure for representing healthcare associations patterns that consist of concepts picked up from various taxonomies. Then, the mining process is formulated as a combination of finding the large itemsets, generating, updating and output the association patterns. Crucial mechanisms in each step will be clarified. At last, this paper presents experimental results regarding efficiency, scalability, information loss, etc. of the proposed approach to prove the advents of the approach. © 2013 IEEE.
    Relation: International Conference on Computer Medical Applications, ICCMA 2013, 2013, 論文編號 6506172, 2013 International Conference on Computer Medical Applications, ICCMA 2013; Sousse; Tunisia; 20 January 2013 到 22 January 2013; 類別編號CFP13IMB-ART; 代碼 96944
    Data Type: conference
    DOI 連結: http://dx.doi.org/10.1109/ICCMA.2013.6506172
    DOI: 10.1109/ICCMA.2013.6506172
    Appears in Collections:[資訊管理學系] 會議論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML2853View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback