Sciweavers

3070 search results - page 91 / 614
» Making pattern mining useful
Sort
View
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
14 years 5 months ago
Low-Entropy Set Selection.
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...
PKDD
2005
Springer
145views Data Mining» more  PKDD 2005»
14 years 1 months ago
A Correspondence Between Maximal Complete Bipartite Subgraphs and Closed Patterns
For an undirected graph ¢ without self-loop, we prove: (i) that the number of closed patterns in the adjacency matrix of ¢ is even; (ii) that the number of the closed patterns i...
Jinyan Li, Haiquan Li, Donny Soh, Limsoon Wong
VL
2009
IEEE
164views Visual Languages» more  VL 2009»
14 years 2 months ago
QueryMarvel: A visual query language for temporal patterns using comic strips
In many domains, decision makers want to find and understand patterns of events as these patterns often give insight into the causal relationships among events. Current systems to...
Jing Jin, Pedro A. Szekely
ICFP
2012
ACM
11 years 10 months ago
Shake before building: replacing make with haskell
Most complex software projects are compiled using a build tool (e.g. make), which runs commands in an order satisfying userdefined dependencies. Unfortunately, most build tools r...
Neil Mitchell
CIS
2004
Springer
14 years 1 months ago
Application of Web Service in Web Mining
To solve the problems we now encounter in web mining, We first propose a new distributed computing strategy——web service. It suggests building a web mining system based on web ...
Beibei Li, Jiajin Le