Multidimensional data mining for healthcare service portfolio management

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.

[1]  AgrawalRakesh,et al.  Mining association rules between sets of items in large databases , 1993 .

[2]  Maozhen Li,et al.  The grid - core technologies , 2005 .

[3]  Peng Yi-pu,et al.  Improvement of AprioriTid algorithm for mining association rules , 2005 .

[4]  Ramakrishnan Srikant,et al.  Mining generalized association rules , 1995, Future Gener. Comput. Syst..

[5]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[6]  Jennifer Widom,et al.  Clustering association rules , 1997, Proceedings 13th International Conference on Data Engineering.

[7]  Petra Perner,et al.  Data Mining - Concepts and Techniques , 2002, Künstliche Intell..

[8]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[9]  Rakesh Agrawal,et al.  Parallel Mining of Association Rules , 1996, IEEE Trans. Knowl. Data Eng..

[10]  Ronen Feldman,et al.  Book Reviews: The Text Mining Handbook: Advanced Approaches to Analyzing Unstructured Data by Ronen Feldman and James Sanger , 2008, CL.

[11]  Chien-Ming Chen,et al.  Mining interesting association rules from customer databases and transaction databases , 2004, Inf. Syst..

[12]  William Stallings Business Data Communications , 1990 .

[13]  Wynne Hsu,et al.  Mining association rules with multiple minimum supports , 1999, KDD '99.

[14]  Liu Shuang-ying Improvement of AprioriTid Algorithm for Mining Association Rules , 2003 .