Various fit indices exist in structural equation models. Most of these indices are related to the noncentrality parameter (NCP) of the chi-square distribution that the involved test statistic is implicitly assumed to follow. Existing literature suggests that few statistics can be well approximated by chi-square distributions. The meaning of the NCP is not clear when the behavior of the statistic cannot be described by a chi-square distribution. In this paper we define a new measure of model misfit (MMM) as the difference between the expected values of a statistic under the alternative and null hypotheses. This definition does not need to assume that the population covariance matrix is in the vicinity of the proposed model, nor does it need for the test statistic to follow any distribution of a known form. The MMM does not necessarily equal the discrepancy between the model and the population covariance matrix as has been assumed in existing literature. Bootstrap approaches to estimating the MMM and a related quantity are developed. An algorithm for obtaining bootstrap confidence intervals of the MMM is constructed. Examples with practical data sets contrast several measures of model misfit. The quantile-quantile plot is used to illustrate the unrealistic nature of chi-square distribution assumptions under either the null or an alternative hypothesis in practice.
The explosion of on-line information has given rise to many manually constructed topic hierarchies (such as Yahoo!!). But with the current growth rate in the amount of information, manual classification in topic hierarchies results in an immense information bottleneck. Therefore, developing an automatic classifier is an urgent need. However, classifiers suffer from enormous dimensionality, since the dimensionality is determined by the number of distinct keywords in a document corpus. More seriously, most classifiers are either working slowly or they are constructed subjectively without any learning ability. In this paper, we address these problems with a fair feature-subset selection (FFSS) algorithm and an adaptive fuzzy learning network (AFLN) for classification. The FFSS algorithm is used to reduce the enormous dimensionality. It not only gives fair treatment to each category but also has ability to identify useful features, including both positive and negative features. On the other hand, the AFLN provides extremely fast learning ability to model the uncertain behavior for classification so as to correct the fuzzy matrix automatically. Experimental results show that both FFSS algorithm and the AFLN lead to a significant improvement in document classification, compared to alternative approaches. 相似文献
The accurate prediction of the propagation of a wetting front in an unsaturated soil subjected to surficial infiltration is of practical importance to many geotechnical and geoenvironmental problems. The finite element method is the most common solution technique as the hydraulic soil properties are highly nonlinear. Two important issues are often found to create difficulties in such analyses. First, numerical oscillations are usually observed in the calculated pore pressures at the wetting front. Second, when a reasonable mesh size and time step are used, the elevation of the wetting front may be seriously overpredicted. This paper is focused on the second issue. The under-relaxation (UR) technique used in the iterative process within each time step is found to have a serious impact on rate of convergence with refinement in mesh size and time step. Two different techniques are typically used; the first evaluates the hydraulic conductivity using an average of heads calculated from the preceding time node and the most recent iteration of the current time node (UR1), and the second evaluates the hydraulic conductivity using the average of heads calculated from the two most recent iterations of the current time nodes (UR2). The study shows that UR1, which is adopted in programs such as SEEP/W, ensures that the solution converges rapidly to a stable solution within a time step, but may converge to the wrong wetting front at a given elapsed time unless a sufficiently refined mesh is used. UR2 converges much more slowly within a time step, but the error in the wetting front is smaller than that generated by UR1. 相似文献
In this paper, we propose a new approach for signal detection in wireless digital communications based on the neural network with transient chaos and time-varying gain (NNTCTG), and give a concrete model of the signal detector after appropriate transformations and mappings. It is well known that the problem of the maximum likelihood signal detection can be described as a complex optimization problem that has so many local optima that conventional Hopfield-type neural networks fail to solve. By refraining from the serious local optima problem of Hopfield-type neural networks, the NNTCTG makes use of the time-varying parameters of the recurrent neural network to control the evolving behavior of the network so that the network undergoes the transition from chaotic behavior to gradient convergence. It has richer and more flexible dynamics rather than conventional neural networks only with point attractors, so that it can be expected to have much ability to search for globally optimal or near-optimal solutions. After going through a transiently inverse-bifurcation process, the NNTCTG can approach the global optimum or the neighborhood of global optimum of our problem. Simulation experiments have been performed to show the effectiveness and validation of the proposed neural network based method for the signal detection in digital communications. 相似文献
A distributed problem solving system can be characterized as a group of individual cooperating agents running to solve common problems. As dynamic application domains continue to grow in scale and complexity, it becomes more difficult to control the purposeful behavior of agents, especially when unexpected events may occur. This article presents an information and knowledge exchange framework to support distributed problem solving. From the application viewpoint the article concentrates on the stock trading domain; however, many presented solutions can be extended to other dynamic domains. It addresses two important issues: how individual agents should be interconnected so that their resources are efficiently used and their goals accomplished effectively; and how information and knowledge transfer should take place among the agents to allow them to respond successfully to user requests and unexpected external situations. The article introduces an architecture, the MASST system architecture, which supports dynamic information and knowledge exchange among the cooperating agents. The architecture uses a dynamic blackboard as an interagent communication paradigm to facilitate factual data, business rule, and command exchange between cooperating MASST agents. The critical components of the MASST architecture have been implemented and tested in the stock trading domain, and have proven to be a viable solution for distributed problem solving based on cooperating agents 相似文献