1215 search results - page 74 / 243 » Numbers in Multi-relational Data Mining |
132
Voted
IADIS
2008
15 years 6 months ago
2008
We present how to efficiently mine a set of directed acyclic graphs (DAGs) for unconnected, both multi- or single-rooted, and induced fragments. With a new canonical form that is ...
143
Voted
JCP
2007
15 years 4 months ago
2007
— The ability to mine large volumes of distributed datasets enables more precise decision making. However, privacy concerns should be carefully addressed when mining datasets dis...
158
click to vote
WSDM
2012
ACM
14 years 3 days ago
2012
ACM
We study the problem of correlating micro-blogging activity with stock-market events, defined as changes in the price and traded volume of stocks. Specifically, we collect messa...
141
Voted
KDD
2008
ACM
16 years 5 months 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...
141
click to vote
FIMI
2003
15 years 6 months ago
2003
A simple new algorithm is suggested for frequent itemset mining, using item probabilities as the basis for generating candidates. The method first finds all the frequent items, an...