Search
Didn't find any results in this catalog!
But we have some results in other catalogs.Filters
total: 7148
-
Catalog
- Publications 6559 available results
- Journals 7 available results
- Conferences 7 available results
- People 84 available results
- Inventions 1 available results
- Projects 13 available results
- Research Equipment 9 available results
- e-Learning Courses 100 available results
- Events 3 available results
- Open Research Data 365 available results
displaying 1000 best results Help
Search results for: M5 MODEL TREE
-
Critical Case Stochastic Phylogenetic Tree Model via the Laplace Transform
PublicationBirth–and–death models are now a common mathematical tool to describe branching patterns observed in real–world phylogenetic trees. Liggett and Schinazi (2009) is one such example. The authors propose a simple birth–and–death model that is compatible with phylogenetic trees of both influenza and HIV, depending on the birth rate parameter. An interesting special case of this model is the critical case where the birth rate equals the...
-
Tree-based homogeneous ensemble model with feature selection for diabetic retinopathy prediction
Publication -
A Fuzzy Event Tree Model for Accident Scenario Analysis of Ship Stuck in Ice in Arctic Waters
Publication -
Expression-based decision tree model reveals distinct microRNA expression pattern in pediatric neuronal and mixed neuronal-glial tumors
Publication -
Laxer Clinical Criteria for Gaming Disorder May Hinder Future Efforts to Devise an Efficient Diagnostic Approach: A Tree-Based Model Study
PublicationInternet Gaming Disorder (IGD) has been recognized in May 2013 and can be evaluated using the criteria developed by American Psychiatric Association (APA). The present study investigated the role each IGD criteria plays in diagnosing disordered gaming. A total of 3,377 participants (mean age 20 years, SD = 4.3 years) participated in the study. The data collected was scrutinized to detect patterns...
-
Estimation of the Ultimate Strength of FRP Strips-to-Masonry Substrates Bond
PublicationFiber-Reinforced Polymers (FRP) were developed as a new method over the past decades due to their many beneficial mechanical properties, and they are commonly applied to strengthen masonry structures. In this paper, the Artificial Neural Network (ANN), K-fold Cross-Validation (KFCV) technique, Multivariate Adaptive Regression Spline (MARS) method, and M5 Model Tree (M5MT) method were utilized to predict the ultimate strength of...
-
Komputerowo wspomagana klasyfikacja wybranych sygnałów elektromiografii powierzchniowej
PublicationWykorzystywanie sygnałów elektromiografii powierzchniowej (ang. Surface Electromyography, SEMG) w procesach sterowania systemami rehabilitacyjnymi stanowi obecnie standardową procedurę. Popularność SEMG wynika z nieinwazyjności metody oraz możliwości szybkiej i precyzyjnej identyfikacji funkcji mięśniowej. W przypadku osób małoletnich proces klasyfikacji sygnałów jest utrudniony ze względu na mniejsze rozmiary i wyższą dynamikę...
-
The complexity of bicriteria tree-depth
PublicationThe tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph G. We introduce a bicriteria generalization in which additionally the width of the elimination tree needs to be bounded by some input integer b. We are interested in the case when G is the line graph of a tree, proving that the problem is NP-hard and obtaining a polynomial-time additive 2b-approximation algorithm. This particular...
-
On extremal sizes of locally k-tree graphs
PublicationA graph G is a locally k-tree graph if for any vertex v the subgraph induced by the neighbours of v is a k-tree, k>=0, where 0-tree is an edgeless graph, 1-tree is a tree. We characterize the minimum-size locally k-trees with n vertices. The minimum-size connected locally k-trees are simply (k + 1)-trees. For k >= 1, we construct locally k-trees which are maximal with respect to the spanning subgraph relation. Consequently, the...
-
Average Size of a Suffix Tree for Markov Sources
PublicationWe study a suffix tree built from a sequence generated by a Markovian source. Such sources are more realistic probabilistic models for text generation, data compression, molecular applications, and so forth. We prove that the average size of such a suffix tree is asymptotically equivalent to the average size of a trie built over n independentsequences from the same Markovian source. This equivalenceis only known for memoryless...