Sciweavers

3220 search results - page 289 / 644
» Constrained Graph Processes
Sort
View
LREC
2010
202views Education» more  LREC 2010»
15 years 8 months ago
Can Syntactic and Logical Graphs help Word Sense Disambiguation?
This paper presents a word sense disambiguation (WSD) approach based on syntactic and logical representations. The objective here is to run a number of experiments to compare stan...
Amal Zouaq, Michel Gagnon, Benoît Ozell
APVIS
2006
15 years 8 months ago
Predicting graph reading performance: a cognitive approach
Performance and preference measures are commonly used in the assessment of visualization techniques. This is important and useful in understanding differences in effectiveness bet...
Weidong Huang, Seok-Hee Hong, Peter Eades
KDD
2007
ACM
201views Data Mining» more  KDD 2007»
16 years 7 months ago
Structural and temporal analysis of the blogosphere through community factorization
The blogosphere has unique structural and temporal properties since blogs are typically used as communication media among human individuals. In this paper, we propose a novel tech...
Yun Chi, Shenghuo Zhu, Xiaodan Song, Jun'ichi Tate...
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
16 years 19 days ago
Razor: mining distance-constrained embedded subtrees
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...
CEC
2011
IEEE
14 years 6 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow