Sciweavers

122 search results - page 3 / 25
» An Efficient Algorithm for Mining String Databases Under Con...
Sort
View
KDD
2008
ACM
243views Data Mining» more  KDD 2008»
14 years 6 months ago
Permu-pattern: discovery of mutable permutation patterns with proximity constraint
Pattern discovery in sequences is an important problem in many applications, especially in computational biology and text mining. However, due to the noisy nature of data, the tra...
Meng Hu, Jiong Yang, Wei Su
KDD
2005
ACM
106views Data Mining» more  KDD 2005»
13 years 11 months ago
Enhancing the lift under budget constraints: an application in the mutual fund industry
A lift curve, with the true positive rate on the y-axis and the customer pull (or contact) rate on the x-axis, is often used to depict the model performance in many data mining ap...
Lian Yan, Michael Fassino, Patrick Baldasare
TCS
2008
13 years 6 months ago
Algorithms for subsequence combinatorics
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...
Cees H. Elzinga, Sven Rahmann, Hui Wang
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
13 years 6 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 6 months ago
Efficient closed pattern mining in the presence of tough block constraints
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
Krishna Gade, Jianyong Wang, George Karypis