基于BIC与PSO的简约语音识别系统创建

针对当前尚无建立简约高效语音识别系统标准方法的情形,提出了通过贝叶斯信息准则（Bayesian Information Criterion,BIC）中的权衡系数折中选择系统识别率与复杂度,利用改进的粒子群优化（Particle Swarm Optimization,PSO）算法优化声学模型拓扑结构,进而创建高效简约语音识别系统的新方法。TIDigits上的实验表明,与传统方法创建的同复杂度的基线系统相比,用该方法建立的新系统句子正确率提升了7.85%,与同识别率的基线系统相比,系统复杂度降低了51.4%,说明新系统能够以较低的复杂度获得较高的识别率。     

大跨度桥梁风荷载模拟及程序编制

提出了一种有效而实用的风荷载模拟方法.利用工程实际中普遍采用的风速谱,采用多维自回归模型AR,并应用BIC法则确定多维自回归模型的阶数,使模型与功率谱的拟合更具相合性.用VB语言模拟了一座跨度为1000m的悬索桥的主梁随机风场,验证了该方法的有效性.     

基于BIC准则和Gibbs采样的有限混合模型无监督学习算法

针对有限混合模型无监督学习算法分布元个数未知,本文提出了一种基于BIG准则和Cibbs采样的无监督学习算法,通过Gibbs采样算法对混合模型的参数进行估计,进一步计算观测数据的Bayes信息准则(BIC)指标,确定混合分布元个数.仿真实验以高斯混合分布为例,分别利用具有不同个数的分布模型拟合观测数据,分析表明,该算法能...     

LASSO-based diagnosis scheme for multistage processes with binary data

Process monitoring using multistage processes with binary data remains an important and challenging problem in statistical process control (SPC). Although the multistage processes has been extensively studied in the literature, the challenges associated with designing diagnostic schemes when only binary responses are observed are yet to be addressed well. This paper develops a practical LASSO-based diagnostic procedure which combines BIC with the popular adaptive LASSO variable selection method. Given the oracle property of LASSO and its algorithm, the diagnostic result can be obtained easily and quickly. More importantly, the proposed method does not require making any extra tests that are necessary in existing diagnosis methods. Numerical and real-data examples demonstrate the effectiveness of our method.     

A Joint Regression Variable and Autoregressive Order Selection Criterion

Abstract.  In linear regression models with autocorrelated errors, we apply the residual likelihood approach to obtain a residual information criterion (RIC), which can jointly select regression variables and autoregressive orders. We show that RIC is a consistent criterion. In addition, our simulation studies indicate that it outperforms heuristic selection criteria – the Akaike information criterion and the Bayesian information criterion – when the signal-to-noise ratio is not weak.     

基于 BIC 准则和加权皮尔逊距离的居民负荷模式精细识别及预测

针对居民日用电负荷的聚类分析和预测问题提出了一种基于居民用电负荷模式精细分类的预测框架。 为了提高用于 聚类分析的特征质量,首先基于贝叶斯信息准则(BIC)实现特征筛选。 然后,采用基于加权皮尔逊距离的密度峰值法实现居民 用电负荷曲线形态的准确识别。 接下来,通过融合激活函数的方法对长短期记忆(LSTM)预测网络进行改进。 最后,利用改进 后的 LSTM 网络对精细分类的居民用电负荷模式进行预测。 实验结果表明,根据所提出的方法得到的预测误差指标为平均绝 对百分误差(MAPE),MAPE= 6. 6792%,提高了负荷预测质量,在居民用电负荷预测中具有较好的效果。     

结合模型混淆度和BIC准则的语种识别精细建模方法

提出了一种基于语种模型混淆度的模型参数估计方法,并结合贝叶斯信息准则(Bayesian information criterion,BIC)来进行模型的选取,避免了大量标注信息的需求.在NIST-07语种识别30,10和3s的测试任务中,分别给出了在最大似然(Maximum likelihood,ML)准则和最大互信息...     

Improved AIC selection strategy for survival analysis

In survival analysis, it is of interest to appropriately select significant predictors. In this paper, we extend the AIC_C selection procedure of Hurvich and Tsai to survival models to improve the traditional AIC for small sample sizes. A theoretical verification under a special case of the exponential distribution is provided. Simulation studies illustrate that the proposed method substantially outperforms its counterpart: AIC, in small samples, and competes it in moderate and large samples. Two real data sets are also analyzed.     

Locating multiple interacting quantitative trait loci using robust model selection

One of the most popular criteria for model selection is the Bayesian Information Criterion (BIC). It is based on an asymptotic approximation using Bayes rule when the sample size tends to infinity and the dimension of the model is fixed. Although it works well in classical applications, it performs less satisfactorily for high dimensional problems, i.e. when the number of regressors is very large compared to the sample size. For this reason, an alternative version of the BIC has been proposed for the problem of mapping quantitative trait loci (QTLs) considered in genetics. One approach is to locate QTLs by using model selection in the context of a regression model with an extremely large number of potential regressors. Since the assumption of normally distributed errors is often unrealistic in such settings, we extend the idea underlying the modified BIC to the context of robust regression.     

BIC-based node order learning for improving Bayesian network structure learning

Node order is one of the most important factors in learning the structure of a Bayesian network (BN) for probabilistic reasoning. To improve the BN structure learning, we propose a node order learning algorithmbased on the frequently used Bayesian information criterion (BIC) score function. The algorithm dramatically reduces the space of node order and makes the results of BN learning more stable and effective. Specifically, we first find the most dependent node for each individual node, prove analytically that the dependencies are undirected, and then construct undirected subgraphs U_G. Secondly, the U_G- is examined and connected into a single undirected graph U_GC. The relation between the subgraph number and the node number is analyzed. Thirdly, we provide the rules of orienting directions for all edges in UGC, which converts it into a directed acyclic graph (DAG). Further, we rank the DAG’s topology order and describe the BIC-based node order learning algorithm. Its complexity analysis shows that the algorithm can be conducted in linear time with respect to the number of samples, and in polynomial time with respect to the number of variables. Finally, experimental results demonstrate significant performance improvement by comparing with other methods.