Sciweavers

69 search results - page 8 / 14
» Efficient Runtime Generation of Association Rules
Sort
View
DGO
2007
150views Education» more  DGO 2007»
13 years 9 months ago
Event-triggered data and knowledge sharing among collaborating government organizations
Solving complex global problems such as illegal immigration, border control, and terrorism requires government organizations at all levels to share not only data but, more importa...
Seema Degwekar, Jeff DePree, Howard W. Beck, Carla...
TOG
2008
92views more  TOG 2008»
13 years 7 months ago
Optimizing cubature for efficient integration of subspace deformations
We propose an efficient scheme for evaluating nonlinear subspace forces (and Jacobians) associated with subspace deformations. The core problem we address is efficient integration...
Steven S. An, Theodore Kim, Doug L. James
CIKM
2001
Springer
13 years 11 months ago
Sliding-Window Filtering: An Efficient Algorithm for Incremental Mining
We explore in this paper an effective sliding-window filtering (abbreviatedly as SWF) algorithm for incremental mining of association rules. In essence, by partitioning a transact...
Chang-Hung Lee, Cheng-Ru Lin, Ming-Syan Chen
FIW
2007
123views Communications» more  FIW 2007»
13 years 9 months ago
Composing Features by Managing Inconsistent Requirements
Abstract. One approach to system development is to decompose the requirements into features and specify the individual features before composing them. A major limitation of deferri...
Robin C. Laney, Thein Than Tun, Michael Jackson, B...
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
13 years 7 months ago
GAIA: graph classification using evolutionary computation
Discriminative subgraphs are widely used to define the feature space for graph classification in large graph databases. Several scalable approaches have been proposed to mine disc...
Ning Jin, Calvin Young, Wei Wang