Sciweavers

IMCSIT
2010
13 years 9 months ago
Finding Patterns in Strings using Suffixarrays
Abstract--Finding regularities in large data sets requires implementations of systems that are efficient in both time and space requirements. Here, we describe a newly developed sy...
Herman Stehouwer, Menno van Zaanen
KDD
1995
ACM
173views Data Mining» more  KDD 1995»
14 years 3 months ago
Knowledge Discovery in Textual Databases (KDT)
The information age is characterizedby a rapid growth in the amountof information availablein electronicmedia. Traditional data handling methods are not adequate to cope with this...
Ronen Feldman, Ido Dagan
VLDB
2000
ACM
130views Database» more  VLDB 2000»
14 years 3 months ago
Mining Frequent Itemsets Using Support Constraints
Interesting patterns often occur at varied levels of support. The classic association mining based on a uniform minimum support, such as Apriori, either misses interesting pattern...
Ke Wang, Yu He, Jiawei Han
CIMCA
2005
IEEE
14 years 5 months ago
Potentials and Limits of Graph-Algorithms for Discovering Ontology Patterns
The aim of the research presented in this paper is to contribute to reduction of development time for ontologies by discovering reusable parts and patterns. The approach is to use...
Christer Thörn, Orjan Eriksson, Eva Blomqvist...
WCRE
2008
IEEE
14 years 5 months ago
Discovering New Change Patterns in Object-Oriented Systems
Modern software has to evolve to meet the needs of stakeholders; but the nature and scope of this evolution is difficult to anticipate and manage. In this paper, we examine techn...
Stéphane Vaucher, Houari A. Sahraoui, Jean ...
SDM
2009
SIAM
111views Data Mining» more  SDM 2009»
14 years 8 months ago
A New Constraint for Mining Sets in Sequences.
Discovering interesting patterns in event sequences is a popular task in the field of data mining. Most existing methods try to do this based on some measure of cohesion to deter...
Bart Goethals, Boris Cule, Céline Robardet
SIGMOD
2005
ACM
144views Database» more  SIGMOD 2005»
14 years 11 months ago
Mining Periodic Patterns with Gap Requirement from Sequences
We study a problem of mining frequently occurring periodic patterns with a gap requirement from sequences. Given a character sequence S of length L and a pattern P of length l, we...
Minghua Zhang, Ben Kao, David Wai-Lok Cheung, Kevi...
KDD
2006
ACM
183views Data Mining» more  KDD 2006»
14 years 12 months ago
Discovering interesting patterns through user's interactive feedback
In this paper, we study the problem of discovering interesting patterns through user's interactive feedback. We assume a set of candidate patterns (i.e., frequent patterns) h...
Dong Xin, Xuehua Shen, Qiaozhu Mei, Jiawei Han
ICML
2009
IEEE
15 years 10 days ago
Ranking interesting subgroups
Subgroup discovery is the task of identifying the top k patterns in a database with most significant deviation in the distribution of a target attribute Y . Subgroup discovery is ...
Stefan Rueping