Sciweavers

275 search results - page 22 / 55
» The Foundations of Cost-Sensitive Learning
Sort
View
CORR
2008
Springer
108views Education» more  CORR 2008»
13 years 7 months ago
Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there...
Samuel R. Buss, Jan Hoffmann 0002, Jan Johannsen
PR
2011
12 years 10 months ago
A survey of multilinear subspace learning for tensor data
Increasingly large amount of multidimensional data are being generated on a daily basis in many applications. This leads to a strong demand for learning algorithms to extract usef...
Haiping Lu, Konstantinos N. Plataniotis, Anastasio...
AIED
2009
Springer
14 years 2 months ago
Intelligent Tutoring Systems with Multiple Representations and Self-Explanation Prompts Support Learning of Fractions
Although a solid understanding of fractions is foundational in mathematics, the concept of fractions remains a challenging one. Previous research suggests that multiple graphical r...
Martina A. Rau, Vincent Aleven, Nikol Rummel
ICDM
2002
IEEE
133views Data Mining» more  ICDM 2002»
14 years 17 days ago
Learning with Progressive Transductive Support Vector Machine
Support vector machine (SVM) is a new learning method developed in recent years based on the foundations of statistical learning theory. By taking a transductive approach instead ...
Yisong Chen, Guoping Wang, Shihai Dong
CSFW
2011
IEEE
12 years 7 months ago
Regret Minimizing Audits: A Learning-Theoretic Basis for Privacy Protection
Abstract—Audit mechanisms are essential for privacy protection in permissive access control regimes, such as in hospitals where denying legitimate access requests can adversely a...
Jeremiah Blocki, Nicolas Christin, Anupam Datta, A...