Sciweavers

2783 search results - page 113 / 557
» The Nature Of Near-Synonymic Relations
Sort
View
ICGI
2010
Springer
15 years 2 months ago
Inferring Regular Trace Languages from Positive and Negative Samples
In this work, we give an algorithm that infers Regular Trace Languages. Trace languages can be seen as regular languages that are closed under a partial commutation relation called...
Antonio Cano Gómez
IR
2007
15 years 1 months ago
Regularizing query-based retrieval scores
In information retrieval, the cluster hypothesis states: closely related documents tend to be relevant to the same request. We exploit this hypothesis directly by adjusting queryb...
Fernando Diaz
PAKDD
2009
ACM
124views Data Mining» more  PAKDD 2009»
15 years 8 months ago
Dynamic Exponential Family Matrix Factorization
Abstract. We propose a new approach to modeling time-varying relational data such as e-mail transactions based on a dynamic extension of matrix factorization. To estimate effectiv...
Kohei Hayashi, Junichiro Hirayama, Shin Ishii
DMIN
2006
151views Data Mining» more  DMIN 2006»
15 years 2 months ago
Rough Set Theory: Approach for Similarity Measure in Cluster Analysis
- Clustering of data is an important data mining application. One of the problems with traditional partitioning clustering methods is that they partition the data into hard bound n...
Shuchita Upadhyaya, Alka Arora, Rajni Jain
ACL
1998
15 years 2 months ago
Terminological Variation, a Means of Identifying Research Topics from Texts
After extracting terms from a corpus of titles and s in English, syntactic variation relations are identified amongst them in order to detect research topics. Three types of synta...
Fidelia Ibekwe-Sanjuan