KDD
2008
ACM
15 years 26 days ago
2008
ACM
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
KDD
2008
ACM
15 years 26 days ago
2008
ACM
Not only is Wikipedia a comprehensive source of quality information, it has several kinds of internal structure (e.g., relational summaries known as infoboxes), which enable self-...
KDD
2008
ACM
15 years 26 days ago
2008
ACM
Traditional spectral classification has been proved to be effective in dealing with both labeled and unlabeled data when these data are from the same domain. In many real world ap...
KDD
2008
ACM
15 years 26 days ago
2008
ACM
KDD
2008
ACM
15 years 26 days ago
2008
ACM
In this work, we address the problem of joint modeling of text and citations in the topic modeling framework. We present two different models called the Pairwise-Link-LDA and the ...
KDD
2008
ACM
15 years 26 days ago
2008
ACM
How can a search engine automatically provide the best and most appropriate title for a result URL (link-title) so that users will be persuaded to click on the URL? We consider th...
KDD
2008
ACM
15 years 26 days ago
2008
ACM
We propose a visualization method based on a topic model for discrete data such as documents. Unlike conventional visualization methods based on pairwise distances such as multi-d...
KDD
2008
ACM
15 years 26 days ago
2008
ACM
Effective diagnosis of Alzheimer's disease (AD) is of primary importance in biomedical research. Recent studies have demonstrated that neuroimaging parameters are sensitive a...
KDD
2008
ACM
15 years 26 days ago
2008
ACM
KDD
2008
ACM
15 years 26 days ago
2008
ACM
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...