Sciweavers

732 search results - page 35 / 147
» Efficient Frequent Pattern Mining in Relational Databases
Sort
View
GEOINFORMATICA
2006
102views more  GEOINFORMATICA 2006»
13 years 7 months ago
Mining Co-Location Patterns with Rare Events from Spatial Data Sets
Abstract A co-location pattern is a group of spatial features/events that are frequently co-located in the same region. For example, human cases of West Nile Virus often occur in r...
Yan Huang, Jian Pei, Hui Xiong
BDA
2000
13 years 9 months ago
Incremental Mining of Sequential Patterns in Large Databases
In this paper we consider the problem of the incremental mining of sequential patterns when new transactions or new customers are added to an original database. We present a new a...
Florent Masseglia, Pascal Poncelet, Maguelonne Tei...
ACSW
2004
13 years 9 months ago
Cost-Efficient Mining Techniques for Data Streams
A data stream is a continuous and high-speed flow of data items. High speed refers to the phenomenon that the data rate is high relative to the computational power. The increasing...
Mohamed Medhat Gaber, Shonali Krishnaswamy, Arkady...
ICDE
2005
IEEE
146views Database» more  ICDE 2005»
14 years 9 months ago
Mining Evolving Customer-Product Relationships in Multi-Dimensional Space
Previous work on mining transactional database has focused primarily on mining frequent itemsets, association rules, and sequential patterns. However, interesting relationships be...
Xiaolei Li, Jiawei Han, Xiaoxin Yin, Dong Xin
WWW
2006
ACM
14 years 8 months ago
Online mining of frequent query trees over XML data streams
In this paper, we proposed an online algorithm, called FQT-Stream (Frequent Query Trees of Streams), to mine the set of all frequent tree patterns over a continuous XML data strea...
Hua-Fu Li, Man-Kwan Shan, Suh-Yin Lee