Sciweavers

2373 search results - page 433 / 475
» On the Theory of Structural Subtyping
Sort
View
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
15 years 10 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
15 years 10 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
KDD
2003
ACM
161views Data Mining» more  KDD 2003»
15 years 10 months ago
Eliminating noisy information in Web pages for data mining
A commercial Web page typically contains many information blocks. Apart from the main content blocks, it usually has such blocks as navigation panels, copyright and privacy notice...
Lan Yi, Bing Liu, Xiaoli Li
POPL
2006
ACM
15 years 10 months ago
A virtual class calculus
Virtual classes are class-valued attributes of objects. Like virtual methods, virtual classes are defined in an object's class and may be redefined within subclasses. They re...
Erik Ernst, Klaus Ostermann, William R. Cook
POPL
2003
ACM
15 years 10 months ago
New results on the computability and complexity of points - to analysis
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
Venkatesan T. Chakaravarthy