Sciweavers

637 search results - page 112 / 128
» Generating Synthetic Data to Match Data Mining Patterns
Sort
View
PKDD
1999
Springer
106views Data Mining» more  PKDD 1999»
15 years 4 months ago
Heuristic Measures of Interestingness
When mining a large database, the number of patterns discovered can easily exceed the capabilities of a human user to identify interesting results. To address this problem, variou...
Robert J. Hilderman, Howard J. Hamilton
CPM
2011
Springer
283views Combinatorics» more  CPM 2011»
14 years 3 months ago
Frequent Submap Discovery
Combinatorial maps are nice data structures for modeling the topology of nD objects subdivided in cells (e.g., vertices, edges, faces, volumes, ...) by means of incidence and adjac...
Stéphane Gosselin, Guillaume Damiand, Chris...
SIGMOD
2004
ACM
184views Database» more  SIGMOD 2004»
16 years 1 days ago
Identifying Similarities, Periodicities and Bursts for Online Search Queries
We present several methods for mining knowledge from the query logs of the MSN search engine. Using the query logs, we build a time series for each query word or phrase (e.g., `Th...
Michail Vlachos, Christopher Meek, Zografoula Vage...
SDM
2008
SIAM
122views Data Mining» more  SDM 2008»
15 years 1 months ago
Type-Independent Correction of Sample Selection Bias via Structural Discovery and Re-balancing
Sample selection bias is a common problem in many real world applications, where training data are obtained under realistic constraints that make them follow a different distribut...
Jiangtao Ren, Xiaoxiao Shi, Wei Fan, Philip S. Yu
KDD
2006
ACM
179views Data Mining» more  KDD 2006»
16 years 9 days 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