Sciweavers

760 search results - page 95 / 152
» Algorithms for finding clique-transversals of graphs
Sort
View
KDD
1998
ACM
146views Data Mining» more  KDD 1998»
14 years 1 months ago
Mining Association Rules in Hypertext Databases
In this workweproposea generalisation of the notion of associationrule in the contextof flat transactions to that of a compositeassociation rule in the context of a structured dir...
José Borges, Mark Levene
COCOON
2006
Springer
14 years 17 days ago
Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
Christoph Buchheim, Lanbo Zheng
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
13 years 9 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke
ICWSM
2009
13 years 6 months ago
Event Detection and Tracking in Social Streams
Events and stories can be characterized by a set of descriptive, collocated keywords. Intuitively, documents describing the same event will contain similar sets of keywords, and t...
Hassan Sayyadi, Matthew Hurst, Alexey Maykov
BIOCOMP
2008
13 years 10 months ago
Prediction of Protein Function Using Graph Container and Message Passing
We introduce a novel parameter called container flux, which is used to measure the information sharing capacity between two distinct nodes in a graph. Other useful information, bot...
Hongbo Zhou, Qiang Shawn Cheng, Mehdi Zargham