26757666
An infinite family of cubic one-regular graphs with unsolvable automorphism groups
A graph is one-regular if its automorphism group acts freely and transitively on the set of its arcs. In this paper, an infinite family of cubic one-regular graphs with unsolvable automorphism groups is constructed.
11331203
Automorphism groups of Cayley graphs on symmetric groups with generating transposition sets
Let T be a set of transpositions of the symmetric group Sn. The transposition graph Tra(T) of T is the graph with vertex set {1, 2, ..., n} and edge set {ij|(i j) ∈ T}. In this paper it is shown that if n ≥ 3, then the automorphism group of the transposition graph Tra(T) is isomorphic to Aut(Sn, T) = {α ∈ Aut(Sn)|Tα = T} and if T is a minimal generating set of Sn then the automorphism group of the Cayley graph Cay(Sn, T) is the semiproduct R(Sn) Aut(Sn, T), where R(Sn) is the right regular representation of Sn. As a result, we generalize a theorem of Godsil and Royle [C.D. Godsil, G. Royle, Algebraic Graph Theory, Springer, New York, 2001, p. 53] regarding the automorphism groups of Cayley graphs on Sn : if T is a minimal generating set of Sn and the automorphism group of the transposition graph Tra(T) is trivial then the automorphism group of the Cayley graph Cay(Sn, T) is isomorphic to Sn.
27133006
Binary partition based algorithms for mining association rules
Mining association rules is an important data mining problem. A fast binary partition-based algorithm (BPA) for mining association rules in large databases is presented in this paper. Basically, the framework of BPA is similar to that of the algorithm Apriori. In the first pass, all the frequent 1-item sets are divided into two disjoint parts. Accordingly, in each subsequent pass k, we partition the set of all the frequent k-item sets into three subsets. Any two different partitions are disjoint. If necessary, this partitioning procedure can be a recursive one. Therefore, we get a binary partition tree in the first pass and a corresponding ternary partition tree in each subsequent pass k. Due to such a partition, BPA can be very easily parallelized, assuming a shared-memory architecture.
11780341
Sentential Association Based Text Classification Systems
We recently proposed a novel sentential association based approach SAT-MOD for text classification, which views a sentence rather than a document as an association transaction, and uses a novel heuristic called MODFIT to select the most significant itemsets for constructing a category classifier. Based on SAT-MOD, we have developed a prototype system called SAT-Class. In this demo, we demonstrate the effectiveness of our text classification system, and also the readability and refinability of acquired classification rules.