Sciweavers

1232 search results - page 135 / 247
» Evaluating role mining algorithms
Sort
View
KDD
2006
ACM
179views Data Mining» more  KDD 2006»
14 years 10 months ago
Extracting key-substring-group features for text classification
In many text classification applications, it is appealing to take every document as a string of characters rather than a bag of words. Previous research studies in this area mostl...
Dell Zhang, Wee Sun Lee
SISAP
2008
IEEE
115views Data Mining» more  SISAP 2008»
14 years 4 months ago
A Dynamic Pivot Selection Technique for Similarity Search
All pivot-based algorithms for similarity search use a set of reference points called pivots. The pivot-based search algorithm precomputes some distances to these reference points...
Benjamin Bustos, Oscar Pedreira, Nieves R. Brisabo...
ICDM
2003
IEEE
181views Data Mining» more  ICDM 2003»
14 years 3 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
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
14 years 2 months ago
Large Datasets Lead to Overly Complex Models: An Explanation and a Solution
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
Tim Oates, David Jensen
IS
2007
13 years 10 months ago
Discovering frequent geometric subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
Michihiro Kuramochi, George Karypis