Sciweavers

5316 search results - page 946 / 1064
» Which Search Problems Are Random
Sort
View
KDD
1997
ACM
159views Data Mining» more  KDD 1997»
15 years 7 months ago
New Algorithms for Fast Discovery of Association Rules
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mi...
NIL
1991
15 years 7 months ago
Deduction with Supernormal Defaults
In this paper we consider supernormal defaults [Poo88] with a strict partial order defining their priorities [Bre91]. We investigate their relation to minimal or preferential ent...
Stefan Brass
166
Voted
CAISE
2009
Springer
15 years 7 months ago
Ontology-Based Description and Discovery of Business Processes
Just like web services, business processes can be stored in public repositories to be shared and used by third parties, e.g., as building blocks for constructing new business proce...
Khalid Belhajjame, Marco Brambilla
FLAIRS
2010
15 years 6 months ago
Visual Object Detection using Frequent Pattern Mining
Object search in a visual scene is a highly challenging and computationally intensive task. Most of the current object detection techniques extract features from images for classi...
Yousuf Aboobaker Sait, Balaraman Ravindran
AIPS
2008
15 years 6 months ago
The Compression Power of Symbolic Pattern Databases
The heuristics used for planning and search often take the pattern databases generated from abstracted versions of the given state space. Pattern databases are typically stored p ...
Marcel Ball, Robert C. Holte