Sciweavers

2227 search results - page 192 / 446
» Graph Mining based on a Data Partitioning Approach
Sort
View
PKDD
2000
Springer
144views Data Mining» more  PKDD 2000»
15 years 6 months ago
Fast Hierarchical Clustering Based on Compressed Data and OPTICS
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
Markus M. Breunig, Hans-Peter Kriegel, Jörg S...
SAC
2009
ACM
15 years 10 months ago
LEGAL-tree: a lexicographic multi-objective genetic algorithm for decision tree induction
Decision trees are widely disseminated as an effective solution for classification tasks. Decision tree induction algorithms have some limitations though, due to the typical strat...
Márcio P. Basgalupp, Rodrigo C. Barros, And...
ICWE
2009
Springer
15 years 29 days ago
Fine-Grained Analysis of Web Tasks through Data Visualization
Abstract. This paper presents an approach for monitoring several important aspects related to user behaviour during the execution of Web tasks1 . The approach includes the tracking...
Gennaro Costagliola, Vittorio Fuccella
ICDM
2010
IEEE
101views Data Mining» more  ICDM 2010»
15 years 1 months ago
Tru-Alarm: Trustworthiness Analysis of Sensor Networks in Cyber-Physical Systems
A Cyber-Physical System (CPS) integrates physical devices (e.g., sensors, cameras) with cyber (or informational) components to form a situation-integrated analytical system that re...
Lu An Tang, Xiao Yu, Sangkyum Kim, Jiawei Han, Chi...
FMCAD
2008
Springer
15 years 4 months ago
Scheduling Optimisations for SPIN to Minimise Buffer Requirements in Synchronous Data Flow
Synchronous Data flow (SDF) graphs have a simple and elegant semantics (essentially linear algebra) which makes SDF graphs eminently suitable as a vehicle for studying scheduling o...
Pieter H. Hartel, Theo C. Ruys, Marc C. W. Geilen