Sciweavers

2497 search results - page 33 / 500
» A Partial-Repeatability Approach to Data Mining
Sort
View
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
14 years 11 months ago
CFI-Stream: mining closed frequent itemsets in data streams
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
Nan Jiang, Le Gruenwald
WMCSA
2003
IEEE
14 years 4 months ago
Proximity Mining: Finding Proximity using Sensor Data History
Emerging ubiquitous and pervasive computing applications often need to know where things are physically located. To meet this need, many locationsensing systems have been develope...
Toshihiro Takada, Satoshi Kurihara, Toshio Hirotsu...
BPM
2003
Springer
115views Business» more  BPM 2003»
14 years 2 months ago
Mining Most Specific Workflow Models from Event-Based Data
This paper presents an approach on mining most specific workflow models from event-based data. The approach is embedded in the context of data mining and knowledge discovery in dat...
Guido Schimm
CCS
2009
ACM
14 years 5 months ago
A probabilistic approach to hybrid role mining
Role mining algorithms address an important access control problem: configuring a role-based access control system. Given a direct assignment of users to permissions, role mining...
Mario Frank, Andreas P. Streich, David A. Basin, J...
SADM
2008
90views more  SADM 2008»
13 years 10 months ago
ORIGAMI: A Novel and Effective Approach for Mining Representative Orthogonal Graph Patterns
: In this paper, we introduce the concept of -orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are -orthogonal if their similarit...
Vineet Chaoji, Mohammad Al Hasan, Saeed Salem, J&e...