Sciweavers

2888 search results - page 44 / 578
» Measuring the Learning Progress in a
Sort
View
SOCIALCOM
2010
15 years 2 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...
WEBI
2005
Springer
15 years 10 months ago
Measuring the Relative Performance of Schema Matchers
Schema matching is a complex process focusing on matching between concepts describing the data in heterogeneous data sources. There is a shift from manual schema matching, done by...
Shlomo Berkovsky, Yaniv Eytani, Avigdor Gal
NIPS
2008
15 years 5 months ago
Kernel Measures of Independence for non-iid Data
Many machine learning algorithms can be formulated in the framework of statistical independence such as the Hilbert Schmidt Independence Criterion. In this paper, we extend this c...
Xinhua Zhang, Le Song, Arthur Gretton, Alex J. Smo...
IJAR
2007
96views more  IJAR 2007»
15 years 4 months ago
Complexity measurement of fundamental pseudo-independent models
Pseudo-independent (PI) models are a special class of probabilistic domain model (PDM) where a set of marginally independent domain variables shows collective dependency, a specia...
J. Lee, Y. Xiang
WWW
2004
ACM
16 years 5 months ago
Integrating learning objects into an open learning environment: evaluation of learning processes in an informatics learning lab
The Didactics of Informatics research group at the University of Paderborn is involved in efforts to design implement and evaluate a web-based learning laboratory for informatics ...
Johannes Magenheim, Olaf Scheel