Sciweavers

8486 search results - page 78 / 1698
» Ordered Enumeration Method
Sort
View
DAWAK
2004
Springer
13 years 11 months ago
PROWL: An Efficient Frequent continuity Mining Algorithm on Event Sequences
Mining association rule in event sequences is an important data mining problem with many applications. Most of previous studies on association rules are on mining intra-transaction...
Kuo-Yu Huang, Chia-Hui Chang, Kuo-Zui Lin
ACL
2006
13 years 9 months ago
A Term Recognition Approach to Acronym Recognition
We present a term recognition approach to extract acronyms and their definitions from a large text collection. Parenthetical expressions appearing in a text collection are identif...
Naoaki Okazaki, Sophia Ananiadou
DI
2007
81views more  DI 2007»
13 years 7 months ago
Using every part of the buffalo in Windows memory analysis
All Windows memory analysis techniques depend on the examiner’s ability to translate the virtual addresses used by programs and operating system components into the true locatio...
Jesse D. Kornblum
KDD
2012
ACM
187views Data Mining» more  KDD 2012»
11 years 10 months ago
Sampling minimal frequent boolean (DNF) patterns
We tackle the challenging problem of mining the simplest Boolean patterns from categorical datasets. Instead of complete enumeration, which is typically infeasible for this class ...
Geng Li, Mohammed J. Zaki
PLILP
1993
Springer
13 years 11 months ago
Higher-Order Chaotic Iteration Sequences
Chaotic iteration sequences is a method for approximating fixpoints of monotonic functions proposed by Patrick and Radhia Cousot. It may be used in specialisation algorithms for ...
Mads Rosendahl