نتایج جستجو برای: relationship tree

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

2015
Rafet Sifa Fabian Hadiji Julian Runge Anders Drachen Kristian Kersting Christian Bauckhage

Mobile digital games are dominantly released under the freemium business model, but only a small fraction of the players makes any purchases. The ability to predict who will make a purchase enables optimization of marketing efforts, and tailoring customer relationship management to the specific user’s profile. Here this challenge is addressed via two models for predicting purchasing players, us...

1999
James Dullea Il-Yeol Song

In this paper, we present the complete classification of recursive relationships and the criteria that contribute to the structural validity of modeling recursive relationships within the entity-relationship (ER) diagram. Unlike typical other analyses that use only maximum cardinality constraints, we have used both maximum and minimum cardinality constraints in defining the properties and their...

2009
Truc-Vien T. Nguyen Alessandro Moschitti Giuseppe Riccardi

This paper explores the use of innovative kernels based on syntactic and semantic structures for a target relation extraction task. Syntax is derived from constituent and dependency parse trees whereas semantics concerns to entity types and lexical sequences. We investigate the effectiveness of such representations in the automated relation extraction from text. We process the above data by mea...

2010
Fabio Celli

This report describes the UNITN system, a Part-Of-Speech Context Counter, that participated at Semeval 2010 Task 8: MultiWay Classification of Semantic Relations Between Pairs of Nominals. Given a text annotated with Part-of-Speech, the system outputs a vector representation of a sentence containing 20 features in total. There are three steps in the system’s pipeline: first the system produces ...

2008
Longhua Qian Guodong Zhou Fang Kong Qiaoming Zhu Peide Qian

This paper proposes a new approach to dynamically determine the tree span for tree kernel-based semantic relation extraction. It exploits constituent dependencies to keep the nodes and their head children along the path connecting the two entities, while removing the noisy information from the syntactic parse tree, eventually leading to a dynamic syntactic parse tree. This paper also explores e...

2010
Hanna Stelmaszewska B. L. William Wong Nazlin Bhimani Balbir S. Barn

This paper reports on user behaviour when interacting with various electronic resource discovery systems (ERDS) while searching for scholarly material. It focuses on the search strategies applied by 34 students and researchers in Business and Economics from three UK universities to find relevant information on a specified topic. The findings of the study are presented in relation to existing in...

Journal: :IEEE Trans. Communications 1994
Reuven Cohen Adrian Segall

A new MAC protocol for route discovery in multiple-ring network, called the ERD-protocol, has been presented in Part I. The present paper introduces some extensions of this protocol. The first extension indicates how the ERD-protocol can support multicast source routing, where a station seeks routes to multiple destinations. The ERD-protocol supplies the source with a description of a collectio...

2012
Igor Odriozola Eva Navas Inma Hernáez Iñaki Sainz Ibon Saratxaga Jon Sánchez Daniel Erro

This paper presents a method to build CAPT systems for under resourced languages, as Basque, using a general purpose ASR speech database. More precisely, the proposed method consists in automatically determine the threshold of GOP (Goodness Of Pronunciation) scores, which have been used as pronunciation scores in phone-level. Two score distributions have been obtained for each phoneme correspon...

2017

Theorem 1 (i.e., Theorem 3 in the paper) shows that the stability of a linear propagation model can 8 be maintained by regularizing all the weights of each pixel in the hidden layer such the summation 9 of their absolute values is less than one. For the one-way connection, Chen et al. [1] maintain each 10 scalar output p to be within (0, 1). Liu et al. [4] extend the range to (−1, 1), where the...

2011
Hong-Woo Chun Chang-Hoo Jeong Sa-Kwang Song Yunsoo Choi Sung-Pil Choi Won-Kyung Sung

Lots of valuable textual information is used to extract relations between named entities from literature. Composite kernel approach is proposed in this paper. The composite kernel approach calculates similarities based on the following information: (1) Phrase structure in convolution parse tree kernel that has shown encouraging results. (2) Predicate-argument structure patterns. In other words,...

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

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