Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

75

Voted

KDD
2005
ACM

111views Data Mining» more KDD 2005»

Finding partial orders from unordered 0-1 data

16 years 2 months ago

Finding partial orders from unordered 0-1 data

Download www.cs.helsinki.fi

Antti Ukkonen, Mikael Fortelius, Heikki Mannila

Real-time Traffic

Data Mining | KDD 2005 | Unordered 0-1 Data |

claim paper

Related Content

» Pseudo Boolean Programming for Partially Ordered Genomes

» Inferring Gene Orders from Gene Maps Using the Breakpoint Distance

» Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables

» Efficient Learning of Ordered and Unordered Tree Patterns with Contractible Variables

» Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard

» Fragments of order

» Cascading Spatiotemporal Pattern Discovery A Summary of Results

» Consensus Genetic Maps as Median Orders from Inconsistent Sources

» Algorithms for discovering bucket orders from data

Post Info
More Details (n/a)

Added	30 Nov 2009
Updated	30 Nov 2009
Type	Conference
Year	2005
Where	KDD
Authors	Antti Ukkonen, Mikael Fortelius, Heikki Mannila

Comments (0)