Individual Doctor Recommendation in Large Networks by Constrained Optimization

In this paper, the authors try to systematically investigate the problem of individual doctor recommendation and propose a novel method to enable patients to access such intelligent medical service. In their method, the authors first mine doctor-patient ties/relationships via Time-constraint Probability Factor Graph model TPFG from a medical social network. Next, they design a constraint-based optimization framework to efficiently improve the accuracy for doctor-patient relationship mining. Last, they propose a novel Individual Doctor Recommendation Model, namely IDR-Model, to compute doctor recommendation success rate based on weighted average method. The authors conduct experiments to verify the method on a real medical data set. Experimental results show that they obtain better accuracy of mining doctor-patient relationship from the network, and doctor recommendation results of IDR-Model are reasonable and satisfactory.

[1]  Geneva G. Belford,et al.  Multi-aspect expertise matching for review assignment , 2008, CIKM '08.

[2]  Andrew McCallum,et al.  Expertise modeling for matching papers with reviewers , 2007, KDD '07.

[3]  Jiawei Han,et al.  Mining advisor-advisee relationships from research publication networks , 2010, KDD.

[4]  Daniel Dajun Zeng,et al.  Social influence and spread dynamics in social networks , 2012, Frontiers of Computer Science.

[5]  ChengXiang Zhai,et al.  Constrained multi-aspect expertise matching for committee review assignment , 2009, CIKM.

[6]  Jie Tang,et al.  ArnetMiner: extraction and mining of academic social networks , 2008, KDD.

[7]  Yunhao Liu,et al.  Difficulty-Aware Hybrid Search in Peer-to-Peer Networks , 2009, IEEE Trans. Parallel Distributed Syst..

[8]  Abdulmotaleb El-Saddik,et al.  A Framework to bridge social network and body sensor network: An e-Health perspective , 2009, 2009 IEEE International Conference on Multimedia and Expo.

[9]  Yong Shi,et al.  A class of classification and regression methods by multiobjective programming , 2009, Frontiers of Computer Science in China.

[10]  Wenhuang Liu,et al.  Measure oriented training: a targeted approach to imbalanced classification problems , 2012, Frontiers of Computer Science.

[11]  Craig MacDonald,et al.  Voting for candidates: adapting data fusion techniques for an expert search task , 2006, CIKM '06.

[12]  Yunhao Liu,et al.  TSS: Efficient Term Set Search in Large Peer-to-Peer Textual Collections , 2010, IEEE Transactions on Computers.

[13]  Kin Keung Lai,et al.  Benchmarking binary classification models on data sets with different degrees of imbalance , 2009, Frontiers of Computer Science in China.

[14]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

[15]  Thorsten Joachims,et al.  Training linear SVMs in linear time , 2006, KDD '06.

[16]  H. Kuhn The Hungarian method for the assignment problem , 1955 .

[17]  Su-Yun Huang,et al.  Reduced Support Vector Machines: A Statistical Theory , 2007, IEEE Transactions on Neural Networks.

[18]  David Hartvigsen,et al.  The Conference Paper‐Reviewer Assignment Problem* , 1999 .

[19]  Yunhao Liu,et al.  Optimizing Bloom Filter Settings in Peer-to-Peer Multikeyword Searching , 2012, IEEE Transactions on Knowledge and Data Engineering.

[20]  Ralf Herbrich,et al.  Large margin rank boundaries for ordinal regression , 2000 .

[21]  Yunhao Liu,et al.  BloomCast: Efficient and Effective Full-Text Retrieval in Unstructured P2P Networks , 2012, IEEE Transactions on Parallel and Distributed Systems.

[22]  Jimeng Sun,et al.  Social influence analysis in large-scale networks , 2009, KDD.

[23]  Thorsten Joachims,et al.  Optimizing search engines using clickthrough data , 2002, KDD.

[24]  Surendra Sarnikar,et al.  Online Health Social Networks and Patient Health Decision Behavior: A Research Agenda , 2011, 2011 44th Hawaii International Conference on System Sciences.

[25]  Gerard Salton,et al.  A vector space model for automatic indexing , 1975, CACM.