Sciweavers

2180 search results - page 35 / 436
» Algorithms for discovering bucket orders from data
Sort
View
ICAI
2010
13 years 6 months ago
An Efficient Sequential Covering Algorithm for Explaining Subsets of Data
Given a subset of data that differs from the rest, a user often wants an explanation as to why this is the case. For instance, in a database of flights, a user may want to understa...
Matthew Michelson, Sofus A. Macskassy
ICDM
2008
IEEE
175views Data Mining» more  ICDM 2008»
14 years 2 months ago
Overlapping Matrix Pattern Visualization: A Hypergraph Approach
In this work, we study a visual data mining problem: Given a set of discovered overlapping submatrices of interest, how can we order the rows and columns of the data matrix to bes...
Ruoming Jin, Yang Xiang, David Fuhry, Feodor F. Dr...
ICML
2004
IEEE
14 years 9 months ago
Learning first-order rules from data with multiple parts: applications on mining chemical compound data
Inductive learning of first-order theory based on examples has serious bottleneck in the enormous hypothesis search space needed, making existing learning approaches perform poorl...
Cholwich Nattee, Sukree Sinthupinyo, Masayuki Numa...
KDD
2007
ACM
176views Data Mining» more  KDD 2007»
14 years 9 months ago
Mining correlated bursty topic patterns from coordinated text streams
Previous work on text mining has almost exclusively focused on a single stream. However, we often have available multiple text streams indexed by the same set of time points (call...
Xuanhui Wang, ChengXiang Zhai, Xiao Hu, Richard Sp...
DKE
2006
126views more  DKE 2006»
13 years 8 months ago
FRACTURE mining: Mining frequently and concurrently mutating structures from historical XML documents
In the past few years, the fast proliferation of available XML documents has stimulated a great deal of interest in discovering hidden and nontrivial knowledge from XML repositori...
Ling Chen 0002, Sourav S. Bhowmick, Liang-Tien Chi...