Sciweavers

504 search results - page 2 / 101
» Clustering Item Data Sets with Association-Taxonomy Similari...
Sort
View
LREC
2008
129views Education» more  LREC 2008»
13 years 6 months ago
Spectral Clustering for a Large Data Set by Reducing the Similarity Matrix Size
Spectral clustering is a powerful clustering method for document data set. However, spectral clustering needs to solve an eigenvalue problem of the matrix converted from the simil...
Hiroyuki Shinnou, Minoru Sasaki
EDM
2009
116views Data Mining» more  EDM 2009»
13 years 3 months ago
Determining the Significance of Item Order In Randomized Problem Sets
Researchers who make tutoring systems would like to know which sequences of educational content lead to the most effective learning by their students. The majority of data collecte...
Zachary A. Pardos, Neil T. Heffernan
SOCIALCOM
2010
13 years 3 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...
ITSL
2008
13 years 6 months ago
An Empirical Comparison of NML Clustering Algorithms
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...
Petri Kontkanen, Petri Myllymäki
ICDE
2003
IEEE
160views Database» more  ICDE 2003»
14 years 6 months ago
HD-Eye - Visual Clustering of High dimensional Data
Clustering of large data bases is an important research area with a large variety of applications in the data base context. Missing in most of the research efforts are means for g...
Alexander Hinneburg, Daniel A. Keim, Markus Wawryn...