Search Results - TR35~
-
1
Visualizing the construction of incremental Disorder Trie Itemset data structure (DOSTrieIT) for Frequent Pattern Tree (FP-Tree)
Published 2011“…DOSTrieIT can be used later as a compressed source of information for building Frequent Pattern Tree (FP-Tree). To ensure understandability, an appropriate dataset and its processes are graphically presented and details explained.…”
Get full text
Get full text
-
2
Isolation of pigment-producing strain of Staphylococcus kloosii from the respiratory tree of Holothuria (Mertensiothuria) leucospilota (Brandt, 1835) from Malaysian waters
Published 2013“… Staphylococcus kloosii, an orange pigment-producing bacterium, was isolated from the respiratory tree of Holothuria (Mertensiothuria) leucospilota (Brandt 1835) from Teluk Nipah, Pangkor Island, Perak, Malaysia. …”
Get full text
Get full text
-
3
-
4
-
5
A review of knowledge graph embedding methods of TransE, TransH and TransR for missing links
Published 2023“…This review article offers an overview and critical analysis specifically about the methods of knowledge graph embedding which are TransE, TransH, and TransR. The key concepts, methodologies, strengths, and limitations of these methods, along with examining their applications and experiments conducted by existing researchers have been studied. …”
Get full text
Get full text
Get full text
-
6
On connected sub-tree with fixed nodes in Cayley tree of Order 2
Published 2017“…In this paper we found an exact formula for a finite sub-tree counting problem. Note that the formulas, which correspond to two extremal cases, are Catalan Triangle introduced by Shapiro and ballot Catalan triangles. …”
Get full text
Get full text
Get full text
-
7
On connected sub-tree of Cayley tree of order 2 with fixed nodes
Published 2013“…We found an exact formulation for a finite sub-tree counting problem. Solution to two extremal cases are Catalan Triangle introduced by Shapiro and ballot Catalan triangles. …”
Get full text
Get full text
-
8
Application of tree mining to matching of knowledge structures of decision tree type
Published 2007“…In this paper we propose a knowledge matching method which makes use of our previously developed tree mining algorithms for extracting frequent subtrees from a tree structured database. …”
Get full text
-
9
PTree: a tool to draw tree for concept relation tree (CRT)
Published 2008“…Our research project is currently to develop an Automatic Meaning Extraction (AME) System which automatically extracts concepts and their relationships across texts in all domains of knowledge. Concept Relational Tree (CRT) is one of the text analyzer applications used in the AME System to automatically extract concepts and their relationships in a document. …”
Get full text
Get full text
-
10
Development of a tree risk inventory framework for urban trees in Malaysia
Published 2023Subjects: Get full text
Get full text
-
11
-
12
-
13
-
14
-
15
-
16
-
17
-
18
-
19
-
20
On quantum Markov chains on Cayley tree II: phase transitions for the associated chain with XY -Model on the Cayley tree of order tree
Published 2011“…In the present paper, we study forward quantum Markov chains (QMC) defined on a Cayley tree. Using the tree structure of graphs, we give a construction of quantum Markov chains on a Cayley tree. …”
Get full text
Get full text