Sciweavers

282 search results - page 36 / 57
» Generating non-redundant association rules
Sort
View
FUIN
2000
109views more  FUIN 2000»
14 years 9 months ago
Building Knowledge Scouts Using KGL Metalanguage
Knowledge scouts are software agents that autonomously search for and synthesize user-oriented knowledge (target knowledge) in large local or distributed databases. A knowledge ge...
Ryszard S. Michalski, Kenneth A. Kaufman
GIS
2006
ACM
15 years 10 months ago
Mining frequent geographic patterns with knowledge constraints
The large amount of patterns generated by frequent pattern mining algorithms has been extensively addressed in the last few years. In geographic pattern mining, besides the large ...
Luis Otávio Alvares, Paulo Martins Engel, S...
ICCV
2005
IEEE
15 years 11 months ago
Bottom-up/Top-Down Image Parsing by Attribute Graph Grammar
In this paper, we present an attribute graph grammar for image parsing on scenes with man-made objects, such as buildings, hallways, kitchens, and living rooms. We choose one clas...
Feng Han, Song Chun Zhu
ICWN
2008
14 years 11 months ago
Progressive Content-Sensitive Data Retrieval in Sensor Networks
: Problem statement: For a sensor network comprising autonomous and self-organizing data sources, efficient similarity-based search for semantic-rich resources (such as video data)...
Bo Yang, Mareboyana Manohar, Shaoying Kou
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
15 years 10 months ago
CFI-Stream: mining closed frequent itemsets in data streams
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
Nan Jiang, Le Gruenwald