Sciweavers

17688 search results - page 213 / 3538
» Data Set Balancing
Sort
View
SOCIALCOM
2010
15 years 4 months ago
Measuring Similarity between Sets of Overlapping Clusters
The typical task of unsupervised learning is to organize data, for example into clusters, typically disjoint clusters (eg. the K-means algorithm). One would expect (for example) a...
Mark K. Goldberg, Mykola Hayvanovych, Malik Magdon...
AIED
2009
Springer
16 years 1 months ago
Detecting the Learning Value of Items In a Randomized Problem Set
Researchers that make tutoring systems would like to know which pieces of educational content are most effective at promoting learning among their students. Randomized controlled e...
Zachary A. Pardos, Neil T. Heffernan
HICSS
2002
IEEE
130views Biometrics» more  HICSS 2002»
15 years 11 months ago
A Set Theory Based Approach on Applying Domain Semantics to XML Structures
As XML is gathering more and more importance in the field of data interchange in distributed business to business (B2B) applications, it is increasingly important to provide a for...
Wolfgang Schuetzelhofer, Karl M. Göschka
ADBIS
2004
Springer
153views Database» more  ADBIS 2004»
15 years 12 months ago
Cooperative Transaction Processing between Clients and Servers
Business rules are often implemented as stored procedures in a database server. These procedures are triggered by various clients, but the execution load is fully centralized on th...
Steffen Jurk, Ulf Leser, José-Luis Marzo
KDD
2001
ACM
145views Data Mining» more  KDD 2001»
16 years 6 months ago
Proximal support vector machine classifiers
Given a dataset, each element of which labeled by one of k labels, we construct by a very fast algorithm, a k-category proximal support vector machine (PSVM) classifier. Proximal s...
Glenn Fung, Olvi L. Mangasarian