948 Result(s)
within
English
Data Mining and Knowledge Discovery
Information Storage and Retrieval
Information Systems Applications (incl. Internet)
Jian** **
Conference Paper
-
Chapter and Conference Paper
Planning with Domain Rules Based on State-Independent Activation Sets
In AI planning community, planning domains with derived predicates are very challenging to many planning system. Derived predicate is a new application of domain rules and domain knowledge acquisition. In this...
-
Chapter and Conference Paper
Extracting Minimum Unsatisfiable Cores with a Greedy Genetic Algorithm
Explaining the causes of infeasibility of Boolean formulas has practical applications in various fields. We are generally interested in a minimum explanation of infeasibility that excludes irrelevant informati...
-
Chapter and Conference Paper
Hybrid O( \(n \sqrt{n}\) ) Clustering for Sequential Web Usage Mining
We propose a natural neighbor inspired O( \(n \sqrt{n}\) ) hybrid clustering algorithm that combines medoid-based partiti...
-
Chapter and Conference Paper
Training Classifiers for Unbalanced Distribution and Cost-Sensitive Domains with ROC Analysis
ROC (Receiver Operating Characteristic) has been used as a tool for the analysis and evaluation of two-class classifiers, even the training data embraces unbalanced class distribution and cost-sensitiveness. H...
-
Chapter and Conference Paper
Spectral Edit Distance Method for Image Clustering
The spectral graph theories have been widely used in the domain of image clustering where editing distances between graphs are critical. This paper presents a method for spectral edit distance between the grap...
-
Chapter and Conference Paper
(α, k)-anonymity Based Privacy Preservation by Lossy Join
Privacy-preserving data publication for data mining is to protect sensitive information of individuals in published data while the distortion to the data is minimized. Recently, it is shown that (α,k)-anonymity i...
-
Chapter and Conference Paper
Mining Invisible Tasks from Event Logs
Most existing process mining algorithms have problems in dealing with invisible tasks. In this paper, a new process mining algorithm named α # is proposed, which extends the mining capacity of the...
-
Chapter and Conference Paper
Collaborative Scenario Building: The Case of an ‘Advertainment’ Portal
Based on the ongoing development of a portal intended for use during the upcoming Olympics event in 2008, the portal’s main purpose is to allow volunteers, spectators, or any other participants of the Bei**g ...
-
Chapter and Conference Paper
Study on Efficiency and Effectiveness of KSORD
KSORD(Keyword Search Over Relational Databases) is an easy and effective way for casual users or Web users to access relational databases. In recent years, much research on KSORD has been done, and many protot...
-
Chapter and Conference Paper
Active Rules Termination Analysis Through Conditional Formula Containing Updatable Variable
While active rules have been applied in many areas including active databases, XML documentation and Semantic Web, current methods remain largely uncertain of how to terminate active behaviors. Some existing m...
-
Chapter and Conference Paper
SAM: An Efficient Algorithm for F&B-Index Construction
Using index to process structural queries on XML data is a natural way. F&B-Index has been proven to be the smallest index which covers all branching path queries. One disadvantage which prevents the wide usag...
-
Chapter and Conference Paper
Combining Smooth Graphs with Semi-supervised Learning
The key points of the semi-supervised learning problem are the label smoothness and cluster assumptions. In graph-based semi-supervised learning, graph representations of the data are so important that differe...
-
Chapter and Conference Paper
Use of Chinese Short Messages
Short text message (SMS) as a key communication means in China received a lot of attention in research community. 114 subjects attended the study, sharing totally 10843 SMS they sent and received daily. We div...
-
Chapter and Conference Paper
A Distributed Genetic Algorithm for Optimizing the Quality of Grid Workflow
The advancement of Grid and Web service technologies greatly facilitates the aggregation of distributed applications. As the grid workflow generally involves long lasting execution tasks, the quality optimizat...
-
Chapter and Conference Paper
Efficient Keyword Search over Data-Centric XML Documents
We in this paper investigate keyword search over data-centric XML documents. We first present a novel method to divide an XML document into self-integrated subtrees, which are connected subtrees and can captur...
-
Chapter and Conference Paper
CLEF-2006 CL-SR at Maryland: English and Czech
The University of Maryland participated in the English and Czech tasks. For English, one monolingual run using fields based on automatic transcription (the required condition) and one (otherwise identical) cro...
-
Chapter and Conference Paper
Categorizing Software Engineering Knowledge Using a Combination of SWEBOK and Text Categorization
In this paper, we utilize a combination of SWEBOK and text categorization to categorize software engineering knowledge. SWEBOK serves as a backbone taxonomy while text categorization provides a collection of a...
-
Chapter and Conference Paper
Record Extraction Based on User Feedback and Document Selection
In recent years, the research of record extraction from large document data is becoming popular. However there still exist some problems in record extraction. 1) when large document data is used for the target...
-
Chapter and Conference Paper
Exploiting Connection Relation to Compress Data Graph
In this paper, we propose an approach to compress data graph by exploiting connection relations which are some particular entity-relationship relations in relational databses. Our method not only can make a la...
-
Chapter and Conference Paper
Information Retrieval Test Collection for Searching Spontaneous Czech Speech
This paper describes the design of the first large-scale IR test collection built for the Czech language. The creation of this collection also happens to be very challenging, as it is based on a continuous tex...
