Behrang QasemiZadeh

Behrang QasemiZadeh

Auto-generated profile, based on publicly available information

Behrang QasemiZadeh

DFG SFB 991 Heinrich-Heine-Universität Düsseldorf Düsseldorf, Germany

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2014
Verified
Conference Paper
Open access
BZBehrang Q. Zadeh
Behrang Q. Zadeh
SHSiegfried Handschuh
Siegfried Handschuh

1 September 2010
Verified
Conference Paper
Open access
BQBehrang Qasemizadeh
Behrang Qasemizadeh
PBPaul Buitelaar
Paul Buitelaar
FMFergal Monaghan
Fergal Monaghan
This paper describes steps that have been taken to construct a development dataset for the task of Technology Structure Mining. We have defined the proposed task as the process of mapping a scientific corpus into a labeled digraph named a Technology Structure Graph as described in the paper. The generated graph expresses the domain semantics in terms of interdependencies between pairs of technologies that are named (introduced) in the target scientific corpus. The dataset comprises a set of sentences extracted from the ACL Anthology Corpus. Each sentence is annotated with at least two technologies in the domain of Human Language Technology and the interdependence between them. The annotations - technology mark-up and their interdependencies - are expressed at two layers: lexical and termino-conceptual. Lexical representation of technologies comprises varying lexicalizations of a technology. However, at the termino-conceptual layer all these lexical variations refer to the same concept. We have adopted the same approach for representing Semantic Relations, at the lexical layer a semantic relation is a predicate i.e. defined based on the sentence surface structure, however at the termino-conceptual layer semantic relations are classified into conceptual relations either taxonomic or non-taxonomic. Morover, the contexts that interdependencies are extracted from are classified into five groups based on the linguistic criteria and syntactic structure that are identified by the human annotators. The dataset initially comprises of 482 sentences. We hope this effort results in a benchmark that can be used for the technology structure mining task as defined in the paper.

1 June 2006
Verified
Conference Paper
Closed access
BQBehrang QasemiZadeh
Behrang QasemiZadeh
AIAli Ilkhani
Ali Ilkhani
AGAmir Ganjeii
Amir Ganjeii
This paper introduces an adaptive, language independent, and 'built-in error pattern free' spell checker. Proposed system suggests proper form of misspelled words using non deterministic traverse of 'ternary search tree' data structure. In other words the problem of spell checking is addressed by traverse a tree with variable weighted edges. The proposed system uses interaction with user to learn error pattern of media. In this way, system improves its suggestions as time goes by

1 January 2006 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
BQBehrang QasemiZadeh
Behrang QasemiZadeh
SRSaeed Rahimi
Saeed Rahimi

11 December 2015
Verified
Book Chapter
Open access
PDF file
BQBehrang QasemiZadeh
Behrang QasemiZadeh
SHSiegfried Handschuh
Siegfried Handschuh
Random indexing (RI) is an incremental method for constructing a vector space model (VSM) with a reduced dimensionality. Previously, the method has been justified using the mathematical framework of Kanerva’s sparse distributed memory. This justification, although intuitively plausible, fails to provide the information that is required to set the parameters of the method. In order to suggest criteria for the method’s parameters, the RI method is revisited and described using the principles of linear algebra and sparse random projections in Euclidean spaces. These simple mathematics are then employed to suggest criteria for setting the method’s parameters and to explain their influence on the estimated distances in the RI-constructed VSMs. The empirical results observed in an evaluation are reported to support the suggested guidelines in the paper.

1 September 2014
Verified
Conference Paper
Open access
BZBehrang Q. Zadeh
Behrang Q. Zadeh
SHSiegfried Handschuh
Siegfried Handschuh
Vector space models (VSMs) are mathematically well-defined frameworks that have been widely used in text processing. In these models, high-dimensional, often sparse vectors represent text units. In an application, the similarity of vectors -- and hence the text units that they represent -- is computed by a distance formula. The high dimensionality of vectors, however, is a barrier to the performance of methods that employ VSMs. Consequently, a dimensionality reduction technique is employed to alleviate this problem. This paper introduces a new method, called Random Manhattan Indexing (RMI), for the construction of L1 normed VSMs at reduced dimensionality. RMI combines the construction of a VSM and dimension reduction into an incremental, and thus scalable, procedure. In order to attain its goal, RMI employs the sparse Cauchy random projections.