Sciweavers

388 search results - page 69 / 78
» Mining Frequent Itemsets Using Support Constraints
Sort
View
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
14 years 8 months ago
Cleaning disguised missing data: a heuristic approach
In some applications such as filling in a customer information form on the web, some missing values may not be explicitly represented as such, but instead appear as potentially va...
Ming Hua, Jian Pei
IDA
2005
Springer
14 years 1 months ago
From Local Pattern Mining to Relevant Bi-cluster Characterization
Clustering or bi-clustering techniques have been proved quite useful in many application domains. A weakness of these techniques remains the poor support for grouping characterizat...
Ruggero G. Pensa, Jean-François Boulicaut
ICDE
1995
IEEE
192views Database» more  ICDE 1995»
14 years 8 months ago
Mining Sequential Patterns
Abstract. The problem of mining sequential patterns was recently introduced in 3 . We are given a database of sequences, where each sequence is a list of transactions ordered by tr...
Rakesh Agrawal, Ramakrishnan Srikant
ICTAI
2007
IEEE
14 years 1 months ago
A Probabilistic Substructure-Based Approach for Graph Classification
The classification of graph based objects is an important challenge from a knowledge discovery standpoint and has attracted considerable attention recently. In this paper, we pres...
H. D. K. Moonesinghe, Hamed Valizadegan, Samah Jam...
KDD
2003
ACM
124views Data Mining» more  KDD 2003»
14 years 8 months ago
Information-theoretic co-clustering
Two-dimensional contingency or co-occurrence tables arise frequently in important applications such as text, web-log and market-basket data analysis. A basic problem in contingenc...
Inderjit S. Dhillon, Subramanyam Mallela, Dharmend...