Sciweavers

1749 search results - page 36 / 350
» An ICA algorithm for analyzing multiple data sets
Sort
View
GRC
2010
IEEE
13 years 10 months ago
Local Pattern Mining from Sequences Using Rough Set Theory
Abstract--Sequential pattern mining is a crucial but challenging task in many applications, e.g., analyzing the behaviors of data in transactions and discovering frequent patterns ...
Ken Kaneiwa, Yasuo Kudo
ICDM
2008
IEEE
182views Data Mining» more  ICDM 2008»
14 years 3 months ago
Multiple-Instance Regression with Structured Data
We present a multiple-instance regression algorithm that models internal bag structure to identify the items most relevant to the bag labels. Multiple-instance regression (MIR) op...
Kiri L. Wagstaff, Terran Lane, Alex Roper
CCCG
2008
13 years 10 months ago
Core-Preserving Algorithms
We define a class of algorithms for constructing coresets of (geometric) data sets, and show that algorithms in this class can be dynamized efficiently in the insertiononly (data ...
Hamid Zarrabi-Zadeh
BIBE
2007
IEEE
151views Bioinformatics» more  BIBE 2007»
13 years 11 months ago
On the Effectiveness of Constraints Sets in Clustering Genes
—In this paper, we have modified a constrained clustering algorithm to perform exploratory analysis on gene expression data using prior knowledge presented in the form of constr...
Erliang Zeng, Chengyong Yang, Tao Li, Giri Narasim...
TAMC
2009
Springer
14 years 3 months ago
Linear Kernel for Planar Connected Dominating Set
We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and analyze these to obtain a linear kernel for the planar Connected Dominating Set pr...
Daniel Lokshtanov, Matthias Mnich, Saket Saurabh