Sciweavers

1976 search results - page 74 / 396
» Predictive Graph Mining
Sort
View
KDD
2006
ACM
107views Data Mining» more  KDD 2006»
14 years 9 months ago
Out-of-core frequent pattern mining on a commodity PC
In this work we focus on the problem of frequent itemset mining on large, out-of-core data sets. After presenting a characterization of existing out-of-core frequent itemset minin...
Gregory Buehrer, Srinivasan Parthasarathy, Amol Gh...
AOSD
2007
ACM
14 years 26 days ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen
SAC
2008
ACM
13 years 8 months ago
Mining fault-tolerant frequent patterns efficiently with powerful pruning
The mining of frequent patterns in databases has been studied for several years. However, the real-world data tends to be dirty and frequent pattern mining which extracts patterns...
Jhih-Jie Zeng, Guanling Lee, Chung-Chi Lee
KDD
2008
ACM
257views Data Mining» more  KDD 2008»
14 years 9 months ago
Knowledge discovery of semantic relationships between words using nonparametric bayesian graph model
We developed a model based on nonparametric Bayesian modeling for automatic discovery of semantic relationships between words taken from a corpus. It is aimed at discovering seman...
Issei Sato, Minoru Yoshida, Hiroshi Nakagawa
ICDM
2005
IEEE
134views Data Mining» more  ICDM 2005»
14 years 2 months ago
A Preference Model for Structured Supervised Learning Tasks
The preference model introduced in this paper gives a natural framework and a principled solution for a broad class of supervised learning problems with structured predictions, su...
Fabio Aiolli