Sciweavers

1976 search results - page 257 / 396
» Predictive Graph Mining
Sort
View
RSFDGRC
2005
Springer
111views Data Mining» more  RSFDGRC 2005»
14 years 3 months ago
Feature Selection with Adjustable Criteria
Abstract. We present a study on a rough set based approach for feature selection. Instead of using significance or support, Parameterized Average Support Heuristic (PASH) consider...
Jingtao Yao, Ming Zhang
NAACL
2004
13 years 11 months ago
The (Non)Utility of Predicate-Argument Frequencies for Pronoun Interpretation
State-of-the-art pronoun interpretation systems rely predominantly on morphosyntactic contextual features. While the use of deep knowledge and inference to improve these models wo...
Andrew Kehler, Douglas E. Appelt, Lara Taylor, Ale...
JMLR
2010
144views more  JMLR 2010»
13 years 4 months ago
Maximum Margin Learning with Incomplete Data: Learning Networks instead of Tables
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
Sándor Szedmák, Yizhao Ni, Steve R. ...
WWW
2008
ACM
14 years 10 months ago
Information retrieval and knowledge discovery on the semantic web of traditional chinese medicine
We conduct the first systematical adoption of the Semantic Web solution in the integration, management, and utilization of TCM information and knowledge resources. As the results,...
Zhaohui Wu, Tong Yu, Huajun Chen, Xiaohong Jiang, ...
KDD
2007
ACM
220views Data Mining» more  KDD 2007»
14 years 10 months ago
SCAN: a structural clustering algorithm for networks
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
Xiaowei Xu, Nurcan Yuruk, Zhidan Feng, Thomas A. J...