Results 1 to 10 of about 1,002,612 (293)
On the regularization of extremal three-point functions involving giant gravitons [PDF]
Physics Letters B, 2015 In the AdS5/CFT4 set-up, extremal three-point functions involving two giant 1/2 BPS gravitons and one point-like 1/2 BPS graviton, when calculated using semi-classical string theory methods, match the corresponding three-point functions obtained in the ...
Charlotte Kristjansen +2 more
doaj +6 more sources
A characterization of trees with equal 2-domination and 2-independence numbers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 A set $S$ of vertices in a graph $G$ is a $2$-dominating set if every vertex of $G$ not in $S$ is adjacent to at least two vertices in $S$, and $S$ is a $2$-independent set if every vertex in $S$ is adjacent to at most one vertex of $S$.
Christoph Brause +2 more
doaj +3 more sources
Constructing Minimal Spanning Tree Based on Rough Set Theory for Gene Selection [PDF]
International Journal of Artificial Intelligence & Applications, 2012 Microarray gene dataset often contains high dimensionalities which cause difficulty in clustering and classification. Datasets containing huge number of genes lead to increased complexity and therefore, degradation of dataset handling performance. Often, all the measured features of these high-dimensional datasets are not relevant for understanding the
Soumen Kumar Pati, Asit Kumar Das
+4 more sources
Granulation Using Clustering And Rough Set Theory And Its Tree Representation [PDF]
, 2007 Granular computing deals with representation of information in the form of some aggregates and related methods for transformation and analysis for problem solving. A granulation scheme based on clustering and Rough Set Theory is presented with focus on structured conceptualization of information has been presented in this paper.
Girish Kumar Singh, Sonajharia Minz
openaire +2 more sources
Decision Tree Construction based on Rough Set Theory under Characteristic Relation [PDF]
Proceedings on Intelligent Systems and Knowledge Engineering (ISKE2007), 2007 Several approaches based on rough set have been proposed for constructing decision tree in complete information systems. In fact, many information systems are incomplete in practical applications. In this paper, a new algorithm, Decision Tree Construction based on Rough Set Theory under Characteristic Relation (DTCRSCR), is proposed for mining ...
Jing Song +3 more
openaire +4 more sources
Data mining of the GAW14 simulated data using rough set theory and tree-based methods [PDF]
BMC Genetics, 2005 Abstract Rough set theory and decision trees are data mining methods used for dealing with vagueness and uncertainty. They have been utilized to unearth hidden patterns in complicated datasets collected for industrial processes. The Genetic Analysis Workshop 14 simulated data were generated using a system that implemented multiple ...
Cheng-Lung Huang +4 more
openaire +5 more sources
A Decision Tree Algorithm Based on Rough Set Theory after Dimensionality Reduction [PDF]
International Journal of Computer Applications, 2011 Decision tree technology has proven to be a valuable way of capturing human decision making within a computer. As ID3 select those attribute as splitting attributes which have different values whether it classify dataset properly or not. There is another drawback of ID3 which repeat sub tree many times and select same attribute many times.
Manisha Tantuway +1 more
openaire +2 more sources
Applications of cohomology to set theory II: Todorčević trees
Annals of Pure and Applied Logic, 1996 Abstract We explore an application of homological algebra by developing a cohomology theory for a class of Aronszajn trees. Properties of this class, called Todorcevic trees, are examined. The system is compared to that for Hausdorff gaps introduced in the author's previous work and general results about both tree and gap systems are also proven.
Daniel Eric Talayco
openaire +3 more sources
Enhancing the Color Set Partitioning in Hierarchical Tree (SPIHT) Algorithm Using Correlation Theory [PDF]
Journal of Computer Science, 2011 Problem statement: Efficient color image compression algorithm is essential for mass storage and the transmission of the image. The compression efficiency of the Set Partitioning in Hierarchical Tree (SPIHT) coding algorithm for color images is improved by using correlation theory.
M. Santhi, R. S.D. Wahida Banu
openaire +4 more sources
Event Tree Analysis of Xinda Oil Pipeline Leakage Based on Fuzzy Set Theory [PDF]
The Open Civil Engineering Journal, 2017 Event tree is a logical analysis of probability for outcome events by initiating event and probable subsequent events. However, the evaluation of every single event may contain vague information or cannot be described by a crisp number of probabilities in application.
Liyu Huang, Enbin Liu, Di Wang
openaire +2 more sources