2383 search results - page 103 / 477 » Finding Representative Set from Massive Data |
108
click to vote
KDD
2008
ACM
16 years 2 months ago
2008
ACM
We analyze a massive social network, gathered from the records of a large mobile phone operator, with more than a million users and tens of millions of calls. We examine the distr...
145
click to vote
ADC
2003
Springer
15 years 7 months ago
2003
Springer
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
131
click to vote
IS
2008
15 years 1 months ago
2008
Discovering patterns with highly significance is an important problem in data mining discipline. An episode is defined to be a partially ordered set of events for a consecutive an...
106
click to vote
KDD
2002
ACM
16 years 2 months ago
2002
ACM
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
105
click to vote
BMCBI
2010
15 years 1 months ago
2010
Background: The development of high-throughput laboratory techniques created a demand for computer-assisted result analysis tools. Many of these techniques return lists of genes w...