773 search results - page 99 / 155 » Traversing the Machining Graph |
VLDB
2005
ACM
15 years 3 months ago
2005
ACM
We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive application of fingerprinting via shingles, and is extreme...
STOC
2003
ACM
15 years 10 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
Features in many real world applications such as Cheminformatics, Bioinformatics and Information Retrieval have complex internal structure. For example, frequent patterns mined fr...
FLAIRS
2010
15 years 3 days ago
2010
Nowadays, graph-based knowledge discovery algorithms do not consider numeric attributes (they are discarded in the preprocessing step, or they are treated as alphanumeric values w...
CIKM
2011
Springer
13 years 9 months ago
2011
Springer
This paper addresses the problem of mining named entity translations from comparable corpora, specifically, mining English and Chinese named entity translation. We first observe...