Sciweavers

2227 search results - page 263 / 446
» Graph Mining based on a Data Partitioning Approach
Sort
View
148
Voted
RTSS
2006
IEEE
15 years 9 months ago
LITMUS^RT : A Testbed for Empirically Comparing Real-Time Multiprocessor Schedulers
We present a real-time, Linux-based testbed called LITMUSRT , which we have developed for empirically evaluating multiprocessor real-time scheduling algorithms. We also present th...
John M. Calandrino, Hennadiy Leontyev, Aaron Block...
ICML
2007
IEEE
16 years 4 months ago
Graph clustering with network structure indices
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
Matthew J. Rattigan, Marc Maier, David Jensen
205
Voted
KDD
2000
ACM
222views Data Mining» more  KDD 2000»
15 years 7 months ago
Interactive exploration of very large relational datasets through 3D dynamic projections
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
Li Yang
VLDB
2004
ACM
119views Database» more  VLDB 2004»
16 years 3 months ago
Evaluating holistic aggregators efficiently for very large datasets
Indatawarehousingapplications,numerousOLAP queries involve the processing of holistic aggregators such as computing the "top n," median, quantiles, etc. In this paper, we...
Lixin Fu, Sanguthevar Rajasekaran
174
Voted
SIAMREV
2010
170views more  SIAMREV 2010»
14 years 10 months ago
Network Properties Revealed through Matrix Functions
The newly emerging field of Network Science deals with the tasks of modelling, comparing and summarizing large data sets that describe complex interactions. Because pairwise affin...
Ernesto Estrada, Desmond J. Higham