Sciweavers

323 search results - page 18 / 65
» Collection Selection Based on Historical Performance for Eff...
Sort
View
SDM
2008
SIAM
256views Data Mining» more  SDM 2008»
13 years 10 months ago
Graph Mining with Variational Dirichlet Process Mixture Models
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda, Kenichi Kurihara
AAAI
2010
13 years 10 months ago
Fast Algorithms for Top-k Approximate String Matching
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
Zhenglu Yang, Jianjun Yu, Masaru Kitsuregawa
KDD
2008
ACM
192views Data Mining» more  KDD 2008»
14 years 9 months ago
Partial least squares regression for graph mining
Attributed graphs are increasingly more common in many application domains such as chemistry, biology and text processing. A central issue in graph mining is how to collect inform...
Hiroto Saigo, Koji Tsuda, Nicole Krämer
WSCG
2003
174views more  WSCG 2003»
13 years 10 months ago
An Efficient Algorithm for Codebook Design in Transform Vector Quantization
In this paper, a new wavelet-domain codebook design algorithm is proposed for image coding. The method utilizes mean-squared error and variance based selection schemes for good cl...
Momotaz Begum, Nurun Nahar, Kaneez Fatimah, M. K. ...
EGOV
2004
Springer
14 years 2 months ago
Software Acquisition Based on Business Models
In this paper, we present an approach based on hierarchically structured business models as artifacts of business process modeling that are used in a stepwise acquisition process f...
Peter Regner, Thomas Wiesinger, Josef Küng, R...