政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/74621

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | Items with full text/Total items : 112721/143689 (78%)
Visitors : 49580298 Online Users : 827

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer

政大機構典藏 > 商學院 > 資訊管理學系 > 期刊論文 > Item 140.119/74621

Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/74621

Title:	Multi-dimensional Multi-granularities Data Mining for Discovering Innovative Healthcare Services
Authors:	姜國輝 Chiang, Johannes K;Chu, Chia-Chi
Contributors:	資管系
Keywords:	Multidimensional Data Mining;Healthcare Services;Customer relationship Management (CRM);Association Pattern, Granular Computing.
Date:	2013-03
Issue Date:	2015-04-16 16:51:03 (UTC+8)
Abstract:	Data Mining is getting increasingly important for discovering association patterns for health service innovation and Customer Relationship Management (CRM) etc. Yet, there are deficits of existing data mining techniques. Since most of them perform a 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 to find either frequent or infrequent rules. After a survey of a category of significant health services, we propose a data mining algorithm alone with a forest data structure to solve aforementioned weaknesses at the same time. At first, we construct a forest structure of concept taxonomies that can be used for representing the knowledge space. On top of it, the data mining is developed as a compound process to find the large-itemsets, to generate, to update and to output association rules that can represent services portfolio. After a set of benchmarks derived to measure the performance of data mining algorithms, we present the performance with respect to efficiency, scalability, information loss, etc. The results show that the proposed approach is better than existing methods with regard to the level of efficiency and effectiveness.
Relation:	Journal of Data Processing,3(1),31-37
Data Type:	article
Appears in Collections:	[資訊管理學系] 期刊論文

Files in This Item:

File	Description	Size	Format
243-737-1-PB.pdf		673Kb	Adobe PDF2	700	View/Open

社群 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.

Loading...