Sciweavers

4199 search results - page 309 / 840
» Generalizing Data in Natural Language
Sort
View
DATAMINE
2006
166views more  DATAMINE 2006»
15 years 6 months ago
Accelerated EM-based clustering of large data sets
Motivated by the poor performance (linear complexity) of the EM algorithm in clustering large data sets, and inspired by the successful accelerated versions of related algorithms l...
Jakob J. Verbeek, Jan Nunnink, Nikos A. Vlassis
SIGCSE
2012
ACM
310views Education» more  SIGCSE 2012»
14 years 2 months ago
CSTutor: a pen-based tutor for data structure visualization
We present CSTutor, a sketch-based interface designed to help students understand data structures. It currently supports Linked Lists, Binary Search Trees, AVL Trees, and Heaps, a...
Sarah Buchanan, Brandon Ochs, Joseph J. LaViola Jr...
WWW
2007
ACM
16 years 7 months ago
A clustering method for web data with multi-type interrelated components
Traditional clustering algorithms work on "flat" data, making the assumption that the data instances can only be represented by a set of homogeneous and uniform features...
Levent Bolelli, Seyda Ertekin, Ding Zhou, C. Lee G...
SIGMOD
2008
ACM
96views Database» more  SIGMOD 2008»
16 years 6 months ago
OLAP on sequence data
Many kinds of real-life data exhibit logical ordering among their data items and are thus sequential in nature. However, traditional online analytical processing (OLAP) systems an...
Eric Lo, Ben Kao, Wai-Shing Ho, Sau Dan Lee, Chun ...
IV
2007
IEEE
160views Visualization» more  IV 2007»
16 years 28 days ago
Targeted Projection Pursuit for Interactive Exploration of High- Dimensional Data Sets
High-dimensional data is, by its nature, difficult to visualise. Many current techniques involve reducing the dimensionality of the data, which results in a loss of information. ...
Joe Faith