- Full text PDF available (6)
- This year (0)
- Last 5 years (0)
- Last 10 years (0)
Journals and Conferences
D ata analysis is fundamentally an iterative process in which you issue a query, receive a response, formulate the next query based on the response, and repeat. You usually don’t issue a single, perfectly chosen query and get the information you want from a database; indeed, the purpose of data analysis is to extract unknown information, and in most… (More)
We present a novel algorithm to compute large itemsets online. The user is free to change the support threshold any time during the first scan of the transaction sequence. The algorithm maintains a superset of all large itemsets and for each itemset a shrinking, deterministic interval on its support. After at most 2 scans the algorithm terminates with the… (More)
We show that the isoperimetric function of a nitely generated nilpotent group of class c is bounded above by a polynomial of degree 2c.
We consider amalgamations of nitely generated nilpotent groups of class c. We show that doubles satisfy a polynomial isoperimetric inequality of degree 2c. Generalising doubles we introduce non-twisted amalgamations and show that they satisfy a polynomial isoperimetric inequality as well. We give a su cient condition for amalgamations along abelian… (More)
We present an integration of Mathematica into Prolog using MathLink. We illustrate the interplay between the di erent components by evaluating a simple example. The motivation based on algebraic modeling as well as an application from combinatorial group theory are brie y sketched.
We show that amalgams of nitely generated torsionfree nilpotent groups of class c along a cyclic subgroup satisfy a polynomial isoperimetric inequality of degree 4c. The distortion of the amalgamated subgroup is bounded above by a polynomial of degree c. We also give an example of a non-cyclic amalgam of nitely generated torsionfree nilpotent groups along… (More)