Sciweavers

110 search results - page 2 / 22
» Greedy List Intersection
Sort
View
WSDM
2009
ACM
104views Data Mining» more  WSDM 2009»
14 years 1 months ago
Top-k aggregation using intersections of ranked inputs
There has been considerable past work on efficiently computing top k objects by aggregating information from multiple ranked lists of these objects. An important instance of this...
Ravi Kumar, Kunal Punera, Torsten Suel, Sergei Vas...
KES
2004
Springer
13 years 11 months ago
FIT: A Fast Algorithm for Discovering Frequent Itemsets in Large Databases
Association rule mining is an important data mining problem that has been studied extensively. In this paper, a simple but Fast algorithm for Intersecting attribute lists using a ...
Jun Luo, Sanguthevar Rajasekaran
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
13 years 7 months ago
Yet another algorithm for dense max cut: go greedy
We study dense instances of MaxCut and its generalizations. Following a long list of existing, diverse and often sophisticated approximation schemes, we propose taking the na
Claire Mathieu, Warren Schudy
BMCBI
2008
179views more  BMCBI 2008»
13 years 6 months ago
Improving the power for detecting overlapping genes from multiple DNA microarray-derived gene lists
Background: In DNA microarray gene expression profiling studies, a fundamental task is to extract statistically significant genes that meet certain research hypothesis. Currently,...
Xutao Deng, Jun Xu, Charles Wang
GIS
2007
ACM
13 years 10 months ago
Optimal traversal planning in road networks with navigational constraints
A frequent query in geospatial planning and decision making domains (e.g., emergency response, data acquisition, street cleaning), is to find an optimal traversal plan (OTP) that ...
Leyla Kazemi, Cyrus Shahabi, Mehdi Sharifzadeh, Lu...