Sciweavers

362 search results - page 52 / 73
» Discovering Interesting Holes in Data
Sort
View
83
Voted
PKDD
2007
Springer
95views Data Mining» more  PKDD 2007»
15 years 4 months ago
Pruning Relations for Substructure Discovery of Multi-relational Databases
Multirelational data mining methods discover patterns across multiple interlinked tables (relations) in a relational database. In many large organizations, such a multi-relational ...
Hongyu Guo, Herna L. Viktor, Eric Paquet
KDD
2005
ACM
127views Data Mining» more  KDD 2005»
15 years 3 months ago
Mining closed relational graphs with connectivity constraints
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
Xifeng Yan, Xianghong Jasmine Zhou, Jiawei Han
ICFCA
2007
Springer
15 years 2 months ago
A New and Useful Syntactic Restriction on Rule Semantics for Tabular Datasets
Different rule semantics have been successively defined in many contexts such as implications in artificial intelligence, functional dependencies in databases or association rules...
Marie Agier, Jean-Marc Petit
CIKM
2008
Springer
15 years 5 days ago
Mining term association patterns from search logs for effective query reformulation
Search engine logs are an emerging new type of data that offers interesting opportunities for data mining. Existing work on mining such data has mostly attempted to discover knowl...
Xuanhui Wang, ChengXiang Zhai
KES
2008
Springer
14 years 10 months ago
Driven by Compression Progress
I argue that data becomes temporarily interesting by itself to some self-improving, but computationally limited, subjective observer once he learns to predict or compress the data...
Jürgen Schmidhuber