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.
30099215
Indexing and incremental updating condensed data cube
OLAP (online analytical processing) servers usually pre-compute data cubes to improve the response time of possible aggregate queries over cuboids with different grouping attributes. To reduce the huge size of a sparse data cube, the base single tuples (BSTs) are explored to condense cube tuples aggregated from the same set of source tuples into one tuple, whenever such condensing will not require further aggregate when the cube is used to answer queries. We propose the CuboidTree to index the BST condensed cube. Using both synthetic and real world data, we conducted experiments to demonstrate query processing and bulk incremental updating performance of the indexing scheme.
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.
44503656
s-Regular cubic graphs as coverings of the complete bipartite graph K3, 3
207795841
Automorphism groups of tetravalent Cayley graphs on regular p-groups
Let Cay(G,S) be a connected tetravalent Cayley graph on a regular p-group G and let Aut(G) be the automorphism group of G. In this paper, it is proved that, for each prime p 2,5, the automorphism group of the Cayley graph Cay(G,S) is the semidirect product R(G)@?Aut(G,S) where R(G) is the right regular representation of G and Aut(G,S)={@[email protected]?Aut(G)|S^@a=S}. The proof depends on the classification of finite simple groups. This implies that if p 2,5 then the Cayley graph Cay(G,S) is normal, namely, the automorphism group of Cay(G,S) contains R(G) as a normal subgroup.
43124802
On the Isomorphisms of Cayley Graphs of Abelian Groups
Let G be a finite group, S a subset of G\{1}, and let Cay (G, S) denote the Cayley digraph of G with respect to S. If, for any subset T of G\{1}, Cay(G, S) ≅ Cay(G, T) implies that Sα = T for some α ∈ Aut(G), then S is called a CI-subset. The group G is called a CIM-group if for any minimal generating subset S of G, S ∪ S-1 is a CI-subset. In this paper, CIM-abelian groups are characterized.
1503799
Deza digraphs
We consider a directed version of Deza graphs. A digraph is said to be a Deza digraph if it is regular and the number of common out-neighbors of any two distinct vertices takes on at most two values. We introduce some constructions and develop some basic theory. In particular, constructions from Cayley digraphs, graph lexicograph products and graph directed products are described. Moreover, we characterize a family of normal Deza digraphs, and list all cyclic strictly Deza digraphs with at most six vertices. Finally, connections to weakly distance-regular digraphs are discussed, and all strictly Deza digraphs which are also weakly distance-regular digraphs with at most ten vertices are listed.
1231388
Evolutionary performance-oriented development of parallel programs by composition of components
This paper describes a method for evolutionary component-based development of families of parallel programs to attain performance goals on multiple execution environments for multiple family instances and an implementation of the method. It is based upon combining component-oriented development with integration of parallel/distributed execution and parallel/distributed simulation. Each component may have multiple representations at multiple levels of realization from analytical timing models to production code. Each component is encapsulated with an associative interface specifying its properties and behaviors which enables distinguishing among different implementations (or abstractions) of the same functional behavior which may have different performance behavior. Evolutionary development evolves a program from an abstract performance model to a complete program and may continue evolution during runtime. Performance can be estimated at any stage of realization. The implementation is a compiler which composes parallel/distributed programs from components encapsulated with associative interfaces and a runtime system which supports integrated execution/simulation of parallel programs composed from components at different levels of abstraction and program evolution at runtime by component replacement. Case studies in the application of the evolutionary development method including performance results are given.