Sciweavers

621 search results - page 93 / 125
» Global partial orders from sequential data
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
EDBT
2002
ACM
120views Database» more  EDBT 2002»
15 years 12 months ago
Hyperdatabases: Infrastructure for the Information Space
The amount of stored information is exploding while, at the same time, tools for accessing relevant information are rather under-developed. Usually, all users have a pre-defined vi...
Hans-Jörg Schek
124
Voted
CAD
2004
Springer
14 years 11 months ago
A shape design system using volumetric implicit PDEs
Solid modeling based on partial differential equations (PDEs) can potentially unify both geometric constraints and functional requirements within a single design framework to mode...
Haixia Du, Hong Qin
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
15 years 9 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki
AI
2008
Springer
14 years 12 months ago
Label ranking by learning pairwise preferences
Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations, rather than single values. In the recent ...
Eyke Hüllermeier, Johannes Fürnkranz, We...