Probability of withdrawal is a feature of initial public offering (IPOs), which can be an important parameter in decisions of investors and issuers. Considering the probability of offering withdrawal facilitates more precise estimation of underpricing. In this paper, the effective factors on probability of IPO withdrawal and underpricing in Tehran Stock Exchange have been characterized using regression, and then neural network is applied to estimate the probability of IPO withdrawal and underpricing. To evaluate the performance of our applied method, fuzzy regression is employed and compared with neural network. According to the obtained empirical results, neural network demonstrates better accuracy than fuzzy regression. The results indicate that there is a meaningful relationship between underpricing and probability of withdrawal, and the probability of IPO withdrawal plays an important role in precise evaluation of underpricing. 相似文献
Learning from data streams is a challenging task which demands a learning algorithm with several high quality features. In addition to space complexity and speed requirements needed for processing the huge volume of data which arrives at high speed, the learning algorithm must have a good balance between stability and plasticity. This paper presents a new approach to induce incremental decision trees on streaming data. In this approach, the internal nodes contain trainable split tests. In contrast with traditional decision trees in which a single attribute is selected as the split test, each internal node of the proposed approach contains a trainable function based on multiple attributes, which not only provides the flexibility needed in the stream context, but also improves stability. Based on this approach, we propose evolving fuzzy min–max decision tree (EFMMDT) learning algorithm in which each internal node of the decision tree contains an evolving fuzzy min–max neural network. EFMMDT splits the instance space non-linearly based on multiple attributes which results in much smaller and shallower decision trees. The extensive experiments reveal that the proposed algorithm achieves much better precision in comparison with the state-of-the-art decision tree learning algorithms on the benchmark data streams, especially in the presence of concept drift. 相似文献
Berkeley FrameNet is a lexico-semantic resource for English based on the theory of frame semantics. It has been exploited in a range of natural language processing applications and has inspired the development of framenets for many languages. We present a methodological approach to the extraction and generation of a computational multilingual FrameNet-based grammar and lexicon. The approach leverages FrameNet-annotated corpora to automatically extract a set of cross-lingual semantico-syntactic valence patterns. Based on data from Berkeley FrameNet and Swedish FrameNet, the proposed approach has been implemented in Grammatical Framework (GF), a categorial grammar formalism specialized for multilingual grammars. The implementation of the grammar and lexicon is supported by the design of FrameNet, providing a frame semantic abstraction layer, an interlingual semantic application programming interface (API), over the interlingual syntactic API already provided by GF Resource Grammar Library. The evaluation of the acquired grammar and lexicon shows the feasibility of the approach. Additionally, we illustrate how the FrameNet-based grammar and lexicon are exploited in two distinct multilingual controlled natural language applications. The produced resources are available under an open source license. 相似文献
International Journal of Control, Automation and Systems - In this paper, an on-line gait control scheme is proposed for the biped robots for walking up and down the stairs. In the proposed... 相似文献
In the present study, Multi-objective optimization of composite cylindrical shell under external hydrostatic pressure was investigated. Parameters of mass, cost and buckling pressure as fitness functions and failure criteria as optimization criterion were considered. The objective function of buckling has been used by performing the analytical energy equations and Tsai-Wu and Hashin failure criteria have been considered. Multi-objective optimization was performed by improving the evolutionary algorithm of NSGA-II. Also the kind of material, quantity of layers and fiber orientations have been considered as design variables. After optimizing, Pareto front and corresponding points to Pareto front are presented. Trade of points which have optimized mass and cost were selected by determining the specified pressure as design criteria. Finally, an optimized model of composite cylindrical shell with the optimum pattern of fiber orientations having appropriate cost and mass is presented which can tolerate the maximum external hydrostatic pressure.
Parallel communicating grammar systems with regular control (RPCGS, for short) are introduced, which are obtained from returning regular parallel communicating grammar systems by restricting the derivations that are executed in parallel by the various components through a regular control language. For the class of languages that are generated by RPCGSs with constant communication complexity we derive a characterisation in terms of a restricted type of freely rewriting restarting automaton. From this characterisation we obtain that these languages are semi-linear, and that for RPCGSs with constant communication complexity, the centralised variant has the same generative power as the non-centralised variant. 相似文献
We introduce the notions of fuzzy hypersemigroup, fuzzy hypergroup, fuzzy hyperideal, homomorphism, hyper congruence, fuzzy
homomorphism, fuzzy hypercongruence. The purpose of this note is the study of some characterization of fuzzy hypersemigroup,
fuzzy hyperideal of a fuzzy hypersemigroup and homomorphism and hypercongruence on a hypersemigroup. 相似文献
The compact Genetic Algorithm (cGA) is an Estimation of Distribution Algorithm that generates offspring population according to the estimated probabilistic model of the parent population instead of using traditional recombination and mutation operators. The cGA only needs a small amount of memory; therefore, it may be quite useful in memory-constrained applications. This paper introduces a theoretical framework for studying the cGA from the convergence point of view in which, we model the cGA by a Markov process and approximate its behavior using an Ordinary Differential Equation (ODE). Then, we prove that the corresponding ODE converges to local optima and stays there. Consequently, we conclude that the cGA will converge to the local optima of the function to be optimized. 相似文献