Sciweavers

12863 search results - page 965 / 2573
» Dynamic Data Mining
Sort
View
209
Voted
SDM
2003
SIAM
129views Data Mining» more  SDM 2003»
15 years 9 months ago
Approximate Query Answering by Model Averaging
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
Dmitry Pavlov, Padhraic Smyth
238
Voted
INCDM
2010
Springer
172views Data Mining» more  INCDM 2010»
15 years 6 months ago
Evaluating the Quality of Clustering Algorithms Using Cluster Path Lengths
Many real world systems can be modeled as networks or graphs. Clustering algorithms that help us to organize and understand these networks are usually referred to as, graph based c...
Faraz Zaidi, Daniel Archambault, Guy Melanç...
PVLDB
2010
132views more  PVLDB 2010»
15 years 6 months ago
CoDA: Interactive Cluster Based Concept Discovery
Large data resources are ubiquitous in science and business. For these domains, an intuitive view on the data is essential to fully exploit the hidden knowledge. Often, these data...
Stephan Günnemann, Ines Färber, Hardy Kr...
142
Voted
IJNVO
2011
47views more  IJNVO 2011»
15 years 2 months ago
Harvesting covert networks: a case study of the iMiner database
: Data collection of covert networks is an inherently difficult task because of the very nature of these networks. Researchers find it difficult to locate and access data relating ...
Nasrullah Memon, Uffe Kock Wiil, Reda Alhajj, Clau...
CGF
2008
157views more  CGF 2008»
15 years 7 months ago
Interactive Volume Rendering with Dynamic Ambient Occlusion and Color Bleeding
We propose a method for rendering volumetric data sets at interactive frame rates while supporting dynamic ambient occlusion as well as an approximation to color bleeding. In cont...
Timo Ropinski, Jennis Meyer-Spradow, Stefan Diepen...