Sciweavers

ICDM
2006
IEEE
184views Data Mining» more  ICDM 2006»
14 years 2 months ago
MARGIN: Maximal Frequent Subgraph Mining
The exponential number of possible subgraphs makes the problem of frequent subgraph mining a challenge. Maximal frequent mining has triggered much interest since the size of the s...
Lini T. Thomas, Satyanarayana R. Valluri, Kamalaka...
ICDM
2006
IEEE
226views Data Mining» more  ICDM 2006»
14 years 2 months ago
Converting Output Scores from Outlier Detection Algorithms into Probability Estimates
Current outlier detection schemes typically output a numeric score representing the degree to which a given observation is an outlier. We argue that converting the scores into wel...
Jing Gao, Pang-Ning Tan
ICDM
2006
IEEE
76views Data Mining» more  ICDM 2006»
14 years 2 months ago
How Bayesians Debug
Manual debugging is expensive. And the high cost has motivated extensive research on automated fault localization in both software engineering and data mining communities. Fault l...
Chao Liu 0001, Zeng Lian, Jiawei Han
ICDM
2006
IEEE
161views Data Mining» more  ICDM 2006»
14 years 2 months ago
Personalization in Context: Does Context Matter When Building Personalized Customer Models?
The idea that context is important when predicting customer behavior has been maintained by scholars in marketing and data mining. However, no systematic study measuring how much ...
Michele Gorgoglione, Cosimo Palmisano, Alexander T...
ICDM
2006
IEEE
108views Data Mining» more  ICDM 2006»
14 years 2 months ago
Minimum Enclosing Spheres Formulations for Support Vector Ordinal Regression
We present two new support vector approaches for ordinal regression. These approaches find the concentric spheres with minimum volume that contain most of the training samples. B...
Shirish Krishnaj Shevade, Wei Chu
ICDM
2006
IEEE
166views Data Mining» more  ICDM 2006»
14 years 2 months ago
Mining Generalized Graph Patterns Based on User Examples
There has been a lot of recent interest in mining patterns from graphs. Often, the exact structure of the patterns of interest is not known. This happens, for example, when molecu...
Pavel Dmitriev, Carl Lagoze
ICDM
2006
IEEE
113views Data Mining» more  ICDM 2006»
14 years 2 months ago
Mining Maximal Generalized Frequent Geographic Patterns with Knowledge Constraints
In frequent geographic pattern mining a large amount of patterns is well known a priori. This paper presents a novel approach for mining frequent geographic patterns without assoc...
Vania Bogorny, João Francisco Valiati, Sand...
ICDM
2006
IEEE
95views Data Mining» more  ICDM 2006»
14 years 2 months ago
TOP-COP: Mining TOP-K Strongly Correlated Pairs in Large Databases
Recently, there has been considerable interest in computing strongly correlated pairs in large databases. Most previous studies require the specification of a minimum correlation...
Hui Xiong, Mark Brodie, Sheng Ma
ICDM
2006
IEEE
137views Data Mining» more  ICDM 2006»
14 years 2 months ago
Mining Complex Time-Series Data by Learning Markovian Models
In this paper, we propose a novel and general approach for time-series data mining. As an alternative to traditional ways of designing specific algorithm to mine certain kind of ...
Yi Wang, Lizhu Zhou, Jianhua Feng, Jianyong Wang, ...
ICDM
2006
IEEE
130views Data Mining» more  ICDM 2006»
14 years 2 months ago
A Framework for Regional Association Rule Mining in Spatial Datasets
The immense explosion of geographically referenced data calls for efficient discovery of spatial knowledge. One critical requirement for spatial data mining is the capability to ...
Wei Ding 0003, Christoph F. Eick, Jing Wang 0007, ...