ppxscal/embedding_network huggingface dataset:
Visualization of Web Usage Patterns
Authors: Srinidhi Kannappady, Sudhir P. Mudur, Nematollaah Shiri
Venue: Proceedings of the 10th International Database Engineering and Applications Symposium (2006)

We present a novel approach to visualize web usage patterns by closely coupling the visual rendering process to the data mining technique. In the first step we use Relational Fuzzy Subtractive Clustering as the mining technique to perform fuzzy clustering on web usage sessions. In the second step, we use conventional metric Multidimensional Scaling to obtain an initial positional configuration in 3D space for the cluster centers, and then apply a modified Sammon Mapping technique to further optimize the 3D positions. In the last step, we use the dominant membership values to assign positions to all the other sessions in the given dataset. This is computationally very efficient and at the same time retains the fidelity of the interrelationships much better. We have developed a running prototype of the proposed approach and have demonstrated the utility through experiments using several datasets, including a fairly large web usage dataset of about 100,000 log records.
Provenance and Reliability: Managing Metadata for Statistical Models
Authors: Andrew Westlake
Venue: Proceedings of the 18th International Conference on Scientific and Statistical Database Management (2006)

In this paper we present a general model of the information (meta-data) needed to represent statistical modelling and its results. We discuss the design process for this model (in terms of both objectives and methodology), along with the resultant design. However, we recognise that it is not enough to design a static structure for the meta-data, we also need functionality to support the end users of the statistical results in exploring the provenance and reliability of the results. We have identified some generic functionality that is useful in this, but also recognise that its presentation must be tailored to the domain of interest and the level of understanding of the user.
The Direct Approach to Unified GPC Based on ARMAX/CARIMA/CARMA Model and Application for Pneumatic Actuator Control
Authors: Qiang Song, Fang Liu
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

This paper extends the range of Generalized Predictive Control (GPC) algorithm proposed by Clark et al. based on a CARIMA model, and shows that it is also applicable for an ARMAX model and a CARMA model. Unified formulas are given to provide direct approach to GPC using model parameters without solving Diophantine equations. The extended GPC is applied for the control of a pneumatic actuator based on its ARX model built by neural network. The performance of designed GPC controller is impressive for its quick response and accurate tracking.
Learning probabilistic decision trees for AUC
Authors: Harry Zhang, Jiang Su
Venue: Pattern Recognition Letters (2006)

Accurate ranking, measured by AUC (the area under the ROC curve), is crucial in many real-world applications. Most traditional learning algorithms, however, aim only at high classification accuracy. It has been observed that traditional decision trees produce good classification accuracy but poor probability estimates. Since the ranking generated by a decision tree is based on the class probabilities, a probability estimation tree (PET) with accurate probability estimates is desired in order to yield high AUC. Some researchers ascribe the poor probability estimates of decision trees to the decision tree learning algorithms. To our observation, however, the representation also plays an important role. In this paper, we propose to extend decision trees to represent a joint distribution and conditional independence, called conditional independence trees (CITrees), which is a more suitable model for yielding high AUC. We propose a novel AUC-based algorithm for learning CITrees, and our experiments show that the CITree algorithm outperforms the state-of-the-art decision tree learning algorithm C4.4 (a variant of C4.5), naive Bayes, and NBTree in AUC. Our work provides an effective model and algorithm for applications in which an accurate ranking is required.
Ontology Driven Resource Discovery in Bluetooth Based M-Marketplace
Authors: Michele Ruta, Tommaso Di Noia, Eugenio Di Sciascio, Giacomo Piscitelli
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

We present a semantic-based approach to resource retrieval in an m-commerce scenario. We enhance the original Bluetooth Service Discovery Protocol by integrating a "semantic layer" within the application level of the standard. Given a user request, this layer makes possible a matchmaking process exploiting the semantics of the resources descriptions exposed by a hotspot. It computes the match degree between the request and the goods available i n the m-marketplace taking into account both their ontology-based descriptions and "classical" attributes such as price difference, availability, quantity.
A 3: application-aware acceleration for wireless data networks
Authors: Zhenyun Zhuang, Tae-Young Chang, Raghupathy Sivakumar, Aravind Velayutham
Venue: Proceedings of the 12th annual international conference on Mobile computing and networking (2006)

A tremendous amount of research has been done toward improving transport layer performance over wireless data networks. The improved transport layer protocols are typically application-unaware. In this paper, we argue that the behavior of applications can and do dominate the actual performance experienced. More importantly, we show that for practical applications, application behavior all but completely negates any improvements achievable through better transport layer protocols. In this context, we motivate an application-aware, but application transparent, solution suite called A 3 (application-aware acceleration) that uses a set of design principles realized in an application specific fashion to overcome the typical behavioral problems of applications. We demonstrate the performance of A3 through emulations using realistic application traffic traces.
Effects of part-task and whole-task instructional approaches and learner levels of expertise on learner performance of a complex cognitive task
Authors: Robert A. Reiser
Venue:  (2006)

The study investigated the effects of two instructional approaches (part-task vs. whole-task) and levels of learner expertise (novice vs. advanced) on learner acquisition and transfer of a complex cognitive skill (e.g., preparing a grade book in Excel). In addition, the study examined the effects of these variables on learners' cognitive load, instructional efficiencies, time on task and their attitudes towards the instruction. Fifty-one undergraduate students (pre-service teachers) in four sections of an Introduction to Educational Technology course participated in the study. Two sections were assigned to each of the two instructional approaches. In the part-task condition, a complex skill was decomposed into a series of smaller tasks, each of which was demonstrated and practiced separately; the whole skill was practiced at the end of instruction after practicing part skill. In the whole-task condition, which was based on the 4C/ID-model (van Merri&euml;nboer, 1997), learners were exposed to the entire complex skill right from the beginning of the instruction and were required to practice performing a series of whole tasks. Two 60-minute instructor-led lessons were designed and developed for this study. In each treatment group, the two lessons were presented on the same day, with a five minute break separating the two lessons. The results indicated that there were statistically significant differences between the two treatment groups (whole-task > part-task) on (a) whole-task performance, (b) far-transfer performance, (c) instructional efficiency on the whole-task performance, and (d) instructional efficiency on the far-transfer performance. However, no significant differences were found for (a) cognitive load, (b) time spent on the whole-task test, (c) time spent on the far-transfer test, and (d) attitudes toward instruction. In terms of the levels of learner expertise, the results yielded no interaction among the groups on any of the dependent measures described above; in many cases, however, there were significant differences between the novice and advanced learners, with the advanced learners demonstrating (a) higher scores on the far-transfer test, (b) higher efficiency on the whole-task test, (c) higher efficiency on the far-transfer test, (d) less time spent on the part-task test, and (e) more confidence toward the instruction.
Concurrency in Distributed Systems under Autonomous and Enforced Actions
Authors: Arnim Wedig, Horst F. Wedde, Anca Lazarescu, Elisei Rotaru
Venue: Proceedings of the Sixth International Conference on Application of Concurrency to System Design (2006)

Recently, the formal approach of I-Systems has been newly established through an abstract axiomatic system where events in system components are solely derived and defined from their bilateral interaction with other components as well as from the autonomy as found in decentralized systems. As a major difference to other concurrency models we do not assume that simultaneity or coincidence of events are observable in distributed systems. (This is a fundamental practical problem in autonomous decentralized systems.) We respect this by defining concurrency of events as a system-wide or global concept of causal independence which will be given and characterized by bilateral interaction properties about the components involved, detectable through local checks only. A novel concept of conflicting actions will be given as well. While not complementary to concurrency (as often understood in the area of Petri Nets) concurrency and conflict will be complemented to constitute fundamental relationships between distributed events, through a new relation termed 'event funneling'. Practicerelated issues related to this fine-grained event structure will be discussed.
Grouped-People Splitting Based on Face Detection and Body Proportion Constraints
Authors: S. Piva, L. Comes, M. Asadi, C. S. Regazzoni
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

This paper presents a method based on skin colormodel face detection and human body proportion constraints to estimate the number and position of people entering the monitored scene as a compact group. This helps to split the group into individual persons and solve a common lack in traditional background subtraction based detection and tracking methods: despite common systems, this algorithm can recognize the number and position of the people in a single change detection blob. The hypotheses are: standing subjects, face visibility from the point of view of the camera, a calibrated map to estimate objects' distance from the sensor and to estimate expected people's height on the image plane. These estimations allow dynamic thresholding of several shape parameters and lead to very interesting results.
Guidelines for the incremental identification of aspects in requirements specifications
Authors: Jorge Garc&#x00ed;a-Duque, Mart&#x00ed;n L&#x00f3;pez-Nores, Jos&#x00e9; J. Pazos-Arias, Ana Fern&#x00e1;ndez-Vilas, Rebeca P. D&#x00ed;az-Redondo, Alberto Gil-Solla, Manuel Ramos-Cabrer, Yolanda Blanco-Fern&#x00e1;ndez
Venue: Requirements Engineering (2006)

The desired principle of separation of concerns in software development can be jeopardized by the so-called crosscutting concerns, which tend to be scattered over (and tangled with) the functionality of the modular units of a system. The correct identification of such concerns (and their encapsulation into separate artifacts) is thereby considered a way to improve software understanding and evolution. Pursuing a proper management of concerns from the requirements engineering stage can greatly benefit the entire software life-cycle. In this paper, we propose conceptual guidelines on how to perform the identification of crosscutting concerns in the process of building requirements specifications. We argue that the identification must be carried out in an incremental way, to encapsulate apart the crosscutting concerns even if they have not emerged completely yet.
Mutual Consistency in Real-Time Databases
Authors: Abhay Kumar Jha, Ming Xiong, Krithi Ramamritham
Venue: Proceedings of the 27th IEEE International Real-Time Systems Symposium (2006)

A real-time database is composed of real-time objects whose values remain valid only within their validity intervals. Each object in the database models a real world entity. The freshness of these objects is maintained by update transactions that sample the real world entities. The literature proposes various ways to derive a schedule of transactions that preserves the freshness (also known as absolute consistency) of these objects. But these approaches do not take care of the mutual consistency of the objects, i.e., whether together they represent a logical state of the system. We investigate the problem of checking whether, given an update transaction schedule, a periodic query would be able to read mutually consistent values. We propose solutions for both single- and multiple-query cases in the presence of non-preemptable query executions. Specifically, we first investigate formulas that give the maximal value of mutual gaps among a set of data read at a certain point in time. (A mutual gap for two object values read from the database refers to the difference between the times at which the two objects were updated.) We then propose design approaches to (1) decide the period and relative deadline of a query so that it would guarantee mutual consistency; (2) decide if a given set of queries with relative deadlines and periods can guaranteemutual consistency. Finally, we suggest ways of reducing the complexity of our proposed approaches for both harmonic periods and general cases.
Special purpose ontologies and the representation of pedagogical knowledge
Authors: Tom Murray
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

In intelligent learning/tutoring environments which deal with several types of knowledge or with knowledge in complex domains, some form of pedagogical and curriculum knowledge must be represented in order for the ITS to offer guidance and structure in the learning process. In this paper we illustrate how pedagogical knowledge is represented by various instructional theories and ITS systems, discuss a number of key issues involved in authoring pedagogical knowledge, and show how these issues are addressed in the representational framework of the Eon ITS authoring tools. Unique among the methods we use are Ontology objects, which allow for the creation of representational frameworks tailored to classes of domains or tasks, and "topic levels," which provide an additional level of sophistication beyond network representations, while increasing cognitive clarity.
Prediction-hardness of acyclic conjunctive queries
Authors: Kouichi Hirata
Venue: Theoretical Computer Science (2005)

A conjunctive query problem is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. In this paper, a tuple, a conjunctive query and a database in relational database theory are regarded as a ground atom, a nonrecursive function-free definite clause and a finite set of ground atoms, respectively, in inductive logic programming terminology. An acyclic conjunctive query problem is a conjunctive query problem with acyclicity. Concerned with the acyclic conjunctive query problem, in this paper, we present the hardness results of predicting acyclic conjunctive queries from an instance with a j-database of which predicate symbol is at most j-ary. Also we deal with two kinds of instances, a simple instance as a set of ground atoms and an extended instance as a set of pairs of a ground atom and a description. We mainly show that, from both a simple and an extended instances, acyclic conjunctive queries are not polynomial-time predictable with j-databases (j ≥ 3) under the cryptographic assumptions, and predicting acyclic conjunctive queries with 2-databases is as hard as predicting DNF formulas. Hence, the acyclic conjunctive queries become a natural example that the equivalence between subsumption-efficiency and efficient pac-learnability from both a simple and an extended instances collapses.
Proceedings of the 2006 ACM SIGPLAN workshop on Haskell
Venue: Haskell (2006)

It is with great pleasure that I present to you the proceedings of the 10th ACM SIGPLAN Haskell Workshop -- Haskell'06. The purpose of the workshop is to discuss experience with Haskell and possible future developments of the language. Topics of interest are all aspects of the design, semantics, theory, application, implementation and teaching of Haskell. Since 1997, the Haskell Workshop has been co-located with ICFP -- the International Conference on Functional Programming.This year's call for papers attracted 24 submissions of full papers. Each of the papers was reviewed by at least 3 international reviewers. During a five-day electronic meeting, the Program Committee selected 10 papers for publication in these proceedings and presentation at the workshop. In addition, we accepted 3 demos and a status report on Haskell' -- the next revision of the Haskell language. Also, the program includes the traditional discussion on the "Future of Haskell".
On antipodal Euclidean tight (2e + 1)-designs
Authors: Etsuko Bannai
Venue: Journal of Algebraic Combinatorics: An International Journal (2006)

Neumaier and Seidel (1988) generalized the concept of spherical designs and defined Euclidean designs in ¿ n . For an integer t, a finite subset X of ¿ n given together with a weight function w is a Euclidean t-design if $$\sum_{i=1}^p\frac{w(X_i)}{|S_i|} \int_{S_i}f(\boldsymbol x)d\sigma_i(\boldsymbol x) =\sum_{\boldsymbol x\in X}w(\boldsymbol x) f(\boldsymbol x)$$ holds for any polynomial f(x) of deg(f)¿ t, where {S i , 1¿ i ¿ p} is the set of all the concentric spheres centered at the origin that intersect with X, X i = X¿ S i , and w:X¿ ¿> 0. (The case of X¿ S n¿1 with w¿ 1 on X corresponds to a spherical t-design.) In this paper we study antipodal Euclidean (2e+1)-designs. We give some new examples of antipodal Euclidean tight 5-designs. We also give the classification of all antipodal Euclidean tight 3-designs, the classification of antipodal Euclidean tight 5-designs supported by 2 concentric spheres.
Personalized identity, mentoring and mathematical conversation: the Math Forum's online mentoring project
Authors: Wesley Shumar
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

Drawing on current thinking about identity, social group boundary and informational technology, the research presented in this poster discusses a unique online interactive project at the Math Forum called The Online Mentoring Project. The importance of this work for digital libraries will be highlighted.
Bregman Bubble Clustering: A Robust, Scalable Framework for Locating Multiple, Dense Regions in Data
Authors: Gunjan Gupta, Joydeep Ghosh
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

In traditional clustering, every data point is assigned to at least one cluster. On the other extreme, One Class Clustering algorithms proposed recently identify a single dense cluster and consider the rest of the data as irrelevant. However, in many problems, the relevant data forms multiple natural clusters. In this paper, we introduce the notion of Bregman bubbles and propose Bregman Bubble Clustering (BBC) that seeks k dense Bregman bubbles in the data. We also present a corresponding generative model, Soft BBC, and show several connections with Bregman Clustering, and with a One Class Clustering algorithm. Empirical results on various datasets show the effectiveness of our method.
A Hybrid Machine Learning Approach for Information Extraction
Authors: Eduardo F. A. Silva, Flavia A. Barros, Ricardo B. C. Prudencio
Venue: Proceedings of the Sixth International Conference on Hybrid Intelligent Systems (2006)

Information Extraction (IE) aims to extract from textual documents only the relevant data required by the user. In this paper, we propose a hybrid machine learning approach for IE on semi-structured texts that combines conventional text classification techniques and Hidden Markov Models (HMM). In this approach, a text classifier technique generates an initial output, which is refined by an HMM, providing a globally optimal extraction. An implemented prototype was used to extract information from bibliographic references, reaching a consistent gain in performance through the use of the HMM.
Multi-agent strategic modeling in a robotic soccer domain
Authors: Andraz Bezek, Matjaz Gams, Ivan Bratko
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

This paper presents an algorithm for multi-agent strategic modeling (MASM) applied in a robotic soccer domain. It transforms a multi-agent action sequence into a set of strategic action descriptions in a graphical and symbolic form. By using hierarchically ordered domain knowledge, the algorithm is able to generate graphic and symbolic strategic action descriptions together with corresponding rules at different levels of abstraction. The method was evaluated on the RoboCup Soccer Server Internet League data.
Negative dependence in the balls and bins experiment with applications to order statistics
Authors: Taizhong Hu, Chaode Xie
Venue: Journal of Multivariate Analysis (2006)

Dependence properties of occupancy numbers in the balls and bins experiment are studied. Applying such properties, we investigate further dependence structures of order statistics X1:n ≤ X2:n ≤...≤ Xn:n of n independent random variables X1, X2,...,Xn with possibly different distributions. For 1 ≤ i < j1 < j2 <...< jr ≤ n and fixed (x1,...,xr), we show that P(Xj1:n > x1, Xj2:n > x2,...,Xjr:n > Xr|Xi:n > s) is increasing in s, and that if event Ai,s is either {Xi:n > s} or {Xi:n ≤ s} then P (Xj1:n > x1, Xj2:n > x2,...,Xjr:n > xr|Ai,s) is decreasing in i for fixed s. It is also shown that in this situation, if each random variable Xk has a continuous distribution function and if Ai,s is either {Xi-1:n < s < Xi:n} or {Xi:n = s} then P(Xj1:n > x1, Xj2:n > x2,...,Xjr:n > xr|Ai,s) is decreasing in i for fixed s. We thus complement and extend some results in Dubhashi and Ranjan [Balls and bins: a study in negative dependence, Random Struct. Algorithms 13 (1998) 99-124] and Boland et al. [Bivariate dependence properties and order statistics, J. Multivar. Anal. 56 (1996) 75-89].
Sentences, Hierarchical Clustering for Shopping Search
Authors: Guorong Xu, Changjun Wu, Xiaoli Du
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

Nowadays, as the indices of the major search engines grow to a tremendous proportion, vertical search services can help users to find what they need. Compared with general search, obviously, shopping search's processing scope is greatly narrowed down, and thus the responding time has been decreased and the search engine's accuracy has been improved. For those reasons, shopping search engine, one of the most popular vertical search engines, makes online shopping become more and more convenient. In this paper, we propose a search results clustering approach, which is based on shopping search engine, and will help customers to browse their search results conveniently. The Shopping Search Clustering System (SSCS) is developed to organize the product lists, which are returned by a Shopping and Comparison Search. Experiment results demonstrate that its performance is close to the best known clustering engine Vivisimo.com[2], which is not only the most powerful clustering engine all of the world, but also is the exclusive launched shopping clustering engine.