Woodbridge Jonathan, Mortazavi Bobak, Bui Alex A T, Sarrafzadeh Majid
Computer Science Department, UCLA, Los Angeles, CA 90095.
Medical Imaging Informatics, UCLA, Los Angeles, CA 90095.
Pervasive Mob Comput. 2016 Jun;28:69-80. doi: 10.1016/j.pmcj.2015.09.006. Epub 2015 Oct 27.
Time series subsequence matching has importance in a variety of areas in healthcare informatics. These include case-based diagnosis and treatment as well as discovery of trends among patients. However, few medical systems employ subsequence matching due to high computational and memory complexities. This manuscript proposes a randomized Monte Carlo sampling method to broaden search criteria with minimal increases in computational and memory complexities over -NN indexing. Information gain improves while producing result sets that approximate the theoretical result space, query results increase by several orders of magnitude, and recall is improved with no signi cant degradation to precision over -NN matching.
时间序列子序列匹配在医疗信息学的各个领域都具有重要意义。这些领域包括基于案例的诊断和治疗以及患者趋势的发现。然而,由于计算和内存复杂度较高,很少有医疗系统采用子序列匹配。本文提出了一种随机蒙特卡罗采样方法,以在计算和内存复杂度增加最小的情况下扩展搜索标准,优于最近邻索引。信息增益得到提高,同时生成的结果集接近理论结果空间,查询结果增加了几个数量级,召回率提高,且与最近邻匹配相比精度没有显著下降。