نتایج جستجو برای: tree like structure

تعداد نتایج: 2241874  

2001
Mosleh H. Al-Adhaileh

In this paper, we would like to present an approach to construct a huge Bilingual Knowledge Bank (BKB) from a given bilingual corpus based on the idea of synchronous Structured String-Tree Correspondence (SSTC). The SSTC is a general structure that can associate an arbitrary tree structure to string in a language as desired by the annotator to be the interpretation structure of the string, and ...

2007
Kun-Ming Yu Jiayi Zhou Wei Chen Hsiao

Association rules mining from transaction-oriented databases is an important issue in data mining. Frequent pattern is crucial for association rules generation, time series analysis, classification, etc. There are two categories of algorithms that had been proposed, candidate set generate-and-test approach (Apriori-like) and Pattern growth approach. Many methods had been proposed to solve the a...

2001
Tang Enya Kong Mosleh H. Al-Adhaileh

In this paper, we would like to present an approach to construct a huge Bilingual Knowledge Bank (BKB) from an English Malay bilingual dictionary based on the idea of synchronous Structured String-Tree Correspondence (SSTC). The SSTC is a general structure that can associate an arbitrary tree structure to string in a language as desired by the annotator to be the interpretation structure of the...

Journal: :CoRR 2015
Samuel R. Bowman Christopher D. Manning Christopher Potts

Tree-structured neural networks encode a particular tree geometry for a sentence in the network design. However, these models have at best only slightly outperformed simpler sequence-based models. We hypothesize that neural sequence models like LSTMs are in fact able to discover and implicitly use recursive compositional structure, at least for tasks with clear cues to that structure in the dat...

2011
Bharat Gupta Deepak Garg

Mining frequent itemsets from the large transactional database is a very critical and important task. Many algorithms have been proposed from past many years, But FP-tree like algorithms are considered as very effective algorithms for efficiently mine frequent item sets. These algorithms considered as efficient because of their compact structure and also for less generation of candidates itemse...

Journal: :Discussiones Mathematicae Graph Theory 2014

2008
Hanno Hammer

Entanglement measures based on a logarithmic functional form naturally emerge in any attempt to quantify the degree of entanglement in the state of a multipartite quantum system. These measures can be regarded as generalizations of the classical Shannon-Wiener information of a probability distribution into the quantum regime. In the present work we introduce a previously unknown approach to the...

Journal: :آب و خاک 0
یاسر استواری کامران عسگری حمیدرضا متقیان

introduction: estimation of cation exchange capacity (cec) with reliable soil properties can save time and cost. pedotransfer function (ptf) is a common method in estimating certain soil properties (e.g. cec) that has been wieldy used for many years. one of the common techniques that have been used to develop ptfs is multiple linear regressions. in this method, all easily obtained soil properti...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید