Sciweavers

ICDM
2007
IEEE
148views Data Mining» more  ICDM 2007»
13 years 8 months ago
Sample Selection for Maximal Diversity
The problem of selecting a sample subset sufficient to preserve diversity arises in many applications. One example is in the design of recombinant inbred lines (RIL) for genetic a...
Feng Pan, Adam Roberts, Leonard McMillan, David Th...
ICDM
2007
IEEE
155views Data Mining» more  ICDM 2007»
13 years 8 months ago
Transitional Patterns and Their Significant Milestones
Mining frequent patterns in transaction databases has been studied extensively in data mining research. However, most of the existing frequent pattern mining algorithms do not con...
Qian Wan, Aijun An
ICDM
2007
IEEE
118views Data Mining» more  ICDM 2007»
13 years 8 months ago
Web Site Recommendation Using HTTP Traffic
Ming Jia, Shaozhi Ye, Xing Li, Julie A. Dickerson
ICDM
2007
IEEE
136views Data Mining» more  ICDM 2007»
13 years 8 months ago
Data Discretization Unification
Data discretization is defined as a process of converting continuous data attribute values into a finite set of intervals with minimal loss of information. In this paper, we prove...
Ruoming Jin, Yuri Breitbart, Chibuike Muoh
ICDM
2007
IEEE
159views Data Mining» more  ICDM 2007»
13 years 8 months ago
Spectral Regression: A Unified Approach for Sparse Subspace Learning
Recently the problem of dimensionality reduction (or, subspace learning) has received a lot of interests in many fields of information processing, including data mining, informati...
Deng Cai, Xiaofei He, Jiawei Han
ICDM
2007
IEEE
154views Data Mining» more  ICDM 2007»
13 years 8 months ago
Cocktail Ensemble for Regression
This paper is motivated to improve the performance of individual ensembles using a hybrid mechanism in the regression setting. Based on an error-ambiguity decomposition, we formal...
Yang Yu, Zhi-Hua Zhou, Kai Ming Ting
ICDM
2007
IEEE
169views Data Mining» more  ICDM 2007»
13 years 8 months ago
Efficient Discovery of Frequent Approximate Sequential Patterns
We propose an efficient algorithm for mining frequent approximate sequential patterns under the Hamming distance model. Our algorithm gains its efficiency by adopting a "brea...
Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu
ICDM
2007
IEEE
138views Data Mining» more  ICDM 2007»
13 years 8 months ago
Preserving Privacy through Data Generation
Many databases will not or can not be disclosed without strong guarantees that no sensitive information can be extracted. To address this concern several data perturbation techniq...
Jilles Vreeken, Matthijs van Leeuwen, Arno Siebes
ICDM
2007
IEEE
147views Data Mining» more  ICDM 2007»
13 years 8 months ago
Improving Knowledge Discovery in Document Collections through Combining Text Retrieval and Link Analysis Techniques
In this paper, we present Concept Chain Queries (CCQ), a special case of text mining in document collections focusing on detecting links between two topics across text documents. ...
Wei Jin, Rohini K. Srihari, Hung Hay Ho, Xin Wu
ICDM
2007
IEEE
254views Data Mining» more  ICDM 2007»
13 years 10 months ago
Sampling for Sequential Pattern Mining: From Static Databases to Data Streams
Sequential pattern mining is an active field in the domain of knowledge discovery. Recently, with the constant progress in hardware technologies, real-world databases tend to gro...
Chedy Raïssi, Pascal Poncelet