Sciweavers

20778 search results - page 342 / 4156
» Algorithms for Data Migration
Sort
View
ICPR
2002
IEEE
16 years 7 months ago
Data Clustering Using Evidence Accumulation
We explore the idea of evidence accumulation for combining the results of multiple clusterings. Initially, n d-dimensional data is decomposed into a large number of compact cluste...
Ana L. N. Fred, Anil K. Jain
KDD
2004
ACM
211views Data Mining» more  KDD 2004»
16 years 7 months ago
Towards parameter-free data mining
Most data mining algorithms require the setting of many input parameters. Two main dangers of working with parameter-laden algorithms are the following. First, incorrect settings ...
Eamonn J. Keogh, Stefano Lonardi, Chotirat (Ann) R...
NPIV
1998
ACM
117views Visualization» more  NPIV 1998»
15 years 11 months ago
Data Object and Label Placement For Information Abundant Visualizations
Placing numerous data objects and their corresponding labels in limited screen space is a challenging problem in information visualization systems. Extending map-oriented techniqu...
Jia Li, Catherine Plaisant, Ben Shneiderman
IPPS
1997
IEEE
15 years 11 months ago
A Parallel Priority Data Structure with Applications
We present a parallel priority data structure that improves the running time of certain algorithms for problems that lack a fast and work-efficient parallel solution. As a main a...
Gerth Stølting Brodal, Jesper Larsson Tr&au...
EDM
2010
145views Data Mining» more  EDM 2010»
15 years 8 months ago
Mining Rare Association Rules from e-Learning Data
Rare association rules are those that only appear infrequently even though they are highly associated with very specific data. In consequence, these rules can be very appropriate f...
Cristóbal Romero, José Raúl R...