1146 search results - page 90 / 230 » Optimizing Frequency Queries for Data Mining Applications |
CIKM
2009
Springer
15 years 6 months ago
2009
Springer
Given an author-conference graph, how do we answer proximity queries (e.g., what are the most related conferences for John Smith?); how can we tailor the search result if the user...
KDD
2009
ACM
16 years 12 days ago
2009
ACM
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
122
click to vote
PODS
2006
ACM
15 years 12 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
111
click to vote
KDD
2007
ACM
16 years 8 days ago
2007
ACM
Summarization is an important task in data mining. A major challenge over the past years has been the efficient construction of fixed-space synopses that provide a deterministic q...
171
click to vote
SIGMOD
2007
ACM
16 years 14 hour ago
2007
ACM
The Boolean semantics of SQL queries cannot adequately capture the "fuzzy" preferences and "soft" criteria required in non-traditional data retrieval applicati...