55 search results - page 4 / 11 » Feature Selection via Maximizing Fuzzy Dependency |
SIGIR
2005
ACM
15 years 3 months ago
2005
ACM
This paper develops a general, formal framework for modeling term dependencies via Markov random fields. The model allows for arbitrary text features to be incorporated as eviden...
108
click to vote
KDD
2010
ACM
15 years 1 months ago
2010
ACM
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We propose a quasi-greedy algorithm for approximating the classical uncapacitated 2-level facility location problem (2-LFLP). Our algorithm, unlike the standard greedy algorithm, ...
116
click to vote
EMNLP
2008
14 years 11 months ago
2008
Complex questions that require inferencing and synthesizing information from multiple documents can be seen as a kind of topicoriented, informative multi-document summarization. I...
115
click to vote
ASIAMS
2007
IEEE
15 years 4 months ago
2007
IEEE
This talk has two parts explaining the significance of Rough sets in granular computing in terms of rough set rules and in uncertainty handling in terms of lower and upper approxi...