会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • System and method for text tagging and segmentation using a generative/discriminative hybrid hidden markov model
    • 使用生成/区分性混合隐马尔可夫模型进行文本标记和分割的系统和方法
    • US08086443B2
    • 2011-12-27
    • US12195932
    • 2008-08-21
    • Oksana YakhnenkoRomer E. RosalesRadu Stefan NiculescuLucian Vlad Lita
    • Oksana YakhnenkoRomer E. RosalesRadu Stefan NiculescuLucian Vlad Lita
    • G06F7/00G06F17/21G10L15/14G10L21/00
    • G10L15/142
    • A method for sequence tagging medical patient records includes providing a labeled corpus of sentences taken from a set of medical records, initializing generative parameters θ and discriminative parameters {tilde over (θ)}, providing a functional LL−C×Penalty, where LL is a log-likelihood function LL = log ⁢ ⁢ p ⁡ ( θ , θ ~ ) + ∏ l = 1 M ⁢ ⁢ [ log ⁢ ⁢ p ⁢ ( X l , Y l | θ ~ ) - log ⁢ ⁢ p ⁡ ( X l | θ ~ ) ] + ∏ l = 1 M ⁢ ⁢ log ⁢ ⁢ p ⁡ ( X l | θ ) , ⁢ Penalty = ∑ y ∈ V Y ⁢ ( em y 2 + tr y 2 + e ⁢ ⁢ m ~ y 2 + t ⁢ ⁢ r ~ y 2 ) , where emy=1−Σ∀xiεVXp(xi|y), e{tilde over (m)}y=1−Σ∀xiεVX{tilde over (p)}(xi|y) are emission probability constraints, try=1−Σ∀yiεVYp(yi|y), t{tilde over (r)}y=1−Σ∀yiεVY{tilde over (p)}(yi|y) are transition probability constraints, and extracting gradients of LL−C×Penalty with respect to the transition and emission probabilities and solving θk*,{tilde over (θ)}k*that maximize LL−C×Penalty, initializing a new iteration with θk*,{tilde over (θ)}k* and incrementing C and repeating until solutions have converged, where parameters θ,{tilde over (θ)} are the probabilities that a new sentence X′ is labeled as Y′.
    • 用于对医疗病人记录进行顺序标记的方法包括提供从一组医疗记录中取得的标记语句库,初始化生成参数和假设; 提供一个功能性的LL-C×Penalty,其中LL是一个对数似然函数,LL = log-perm p⁡(&Thetas;,&thetas;〜)+Πl = 1 M ¯[⁢⁢⁢⁡⁡⁡(X as;;⁡⁡⁡⁡⁡ΠΠΠΠΠΠ⁡⁡⁡⁡⁡⁡ |& tt;φ········ VXp (xi | y),e {tilde over(m)} y = 1&Sgr;∀xi&egr; VX {tilde over(p)}(xi | y)是发射概率约束,try = 1-&Sgr;∀yi&egr; (yi | y),t {tilde over(r)} y = 1&Sgr;∀yi&egr; VY {tilde over(p)}(yi | y)是转移概率约束,提取LL-C× 对于过渡和排放概率和解决方案的惩罚; k *,{tilde over(&thetas;)} k *,使LL-C×Penalty最大化,用&thetas初始化新的迭代; k *,{tilde over(&thetas; )} k *并递增C并重复 直到解决方案已经收敛,其中参数&thetas; {tilde over(&thetas;)}是新句子X'被标记为Y'的概率。