Sciweavers

4039 search results - page 117 / 808
» A Method for Dynamic Clustering of Data
Sort
View
PRL
2002
67views more  PRL 2002»
15 years 4 months ago
A pseudo-nearest-neighbor approach for missing data recovery on Gaussian random data sets
Missing data handling is an important preparation step for most data discrimination or mining tasks. Inappropriate treatment of missing data may cause large errors or false result...
Xiaolu Huang, Qiuming Zhu
SIGIR
2000
ACM
15 years 8 months ago
An investigation of linguistic features and clustering algorithms for topical document clustering
We investigate four hierarchical clustering methods (single-link, complete-link, groupwise-average, and single-pass) and two linguistically motivated text features (noun phrase he...
Vasileios Hatzivassiloglou, Luis Gravano, Ankineed...
ICDM
2003
IEEE
181views Data Mining» more  ICDM 2003»
15 years 9 months ago
Dynamic Weighted Majority: A New Ensemble Method for Tracking Concept Drift
Algorithms for tracking concept drift are important for many applications. We present a general method based on the Weighted Majority algorithm for using any online learner for co...
Jeremy Z. Kolter, Marcus A. Maloof
VIS
2008
IEEE
204views Visualization» more  VIS 2008»
16 years 5 months ago
Surface Extraction from Multi-field Particle Volume Data Using Multi-dimensional Cluster Visualization
Data sets resulting from physical simulations typically contain a multitude of physical variables. It is, therefore, desirable that visualization methods take into account the enti...
Lars Linsen, Tran Van Long, Paul Rosenthal, Ste...
IJNSEC
2007
122views more  IJNSEC 2007»
15 years 4 months ago
Detecting Blackhole Attack on AODV-based Mobile Ad Hoc Networks by Dynamic Learning Method
This paper analyzes the blackhole attack which is one of the possible attacks in ad hoc networks. In a blackhole attack, a malicious node impersonates a destination node by sendin...
Satoshi Kurosawa, Hidehisa Nakayama, Nei Kato, Abb...