Sciweavers

235 search results - page 26 / 47
» A New Approach of Eliminating Redundant Association Rules
Sort
View
ICML
2010
IEEE
13 years 8 months ago
Risk minimization, probability elicitation, and cost-sensitive SVMs
A new procedure for learning cost-sensitive SVM classifiers is proposed. The SVM hinge loss is extended to the cost sensitive setting, and the cost-sensitive SVM is derived as the...
Hamed Masnadi-Shirazi, Nuno Vasconcelos
SAC
2010
ACM
14 years 2 months ago
Mining temporal relationships among categories
Temporal text mining deals with discovering temporal patterns in text over a period of time. A Theme Evolution Graph (TEG) is used to visualize when new themes are created and how...
Saket S. R. Mengle, Nazli Goharian
CONSTRAINTS
1999
120views more  CONSTRAINTS 1999»
13 years 7 months ago
Refined Inequalities for Stable Marriage
We consider two approaches to the stable marriage problem: proposal algorithms and describing the stable matching polytope using linear inequalities. We illuminate the relationship...
Brian Aldershof, Olivia M. Carducci, David C. Lore...
LREC
2008
175views Education» more  LREC 2008»
13 years 9 months ago
Arabic WordNet: Semi-automatic Extensions using Bayesian Inference
This presentation focuses on the semi-automatic extension of Arabic WordNet (AWN) using lexical and morphological rules and applying Bayesian inference. We briefly report on the c...
Horacio Rodríguez, David Farwell, Javi Ferr...
ICML
2005
IEEE
14 years 8 months ago
Coarticulation: an approach for generating concurrent plans in Markov decision processes
We study an approach for performing concurrent activities in Markov decision processes (MDPs) based on the coarticulation framework. We assume that the agent has multiple degrees ...
Khashayar Rohanimanesh, Sridhar Mahadevan