Sciweavers

732 search results - page 118 / 147
» Mining Postal Addresses
Sort
View
IADIS
2003
13 years 9 months ago
Query-Based Discovering of Popular Changes in WWW
This paper presents the method for retrieving and summarizing changes in topics from online resources. Users often want to know what are the major changes in their areas of intere...
Adam Jatowt, Khoo Khyou Bun, Mitsuru Ishizuka
SDM
2003
SIAM
184views Data Mining» more  SDM 2003»
13 years 9 months ago
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
Levent Ertöz, Michael Steinbach, Vipin Kumar
DKE
2008
88views more  DKE 2008»
13 years 7 months ago
Quantifying process equivalence based on observed behavior
In various application domains there is a desire to compare process models, e.g., to relate an organization-specific process model to a reference model, to find a web service matc...
Ana Karla Alves de Medeiros, Wil M. P. van der Aal...
KAIS
2008
221views more  KAIS 2008»
13 years 7 months ago
Forecasting skewed biased stochastic ozone days: analyses, solutions and beyond
Much work on skewed, stochastic, high dimensional, and biased datasets usually implicitly solve each problem separately. Recently, we have been approached by Texas Commission on En...
Kun Zhang, Wei Fan
TKDE
2008
153views more  TKDE 2008»
13 years 7 months ago
Discovering Frequent Agreement Subtrees from Phylogenetic Data
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
Sen Zhang, Jason Tsong-Li Wang