Authentication email has already been sent, please check your email box: and activate it as soon as possible.
You can login to My Profile and manage your email alerts.
If you haven’t received the email, please:
|
|
There are 14 papers published in subject: > since this site started. |
Select Subject |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
1. Using Engineering View to Design Better Multi-objective Evolutionary Algorithms | |||
Zheng Bojin ,Li Yuanxiang | |||
Mechanics 30 November 2006 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Multi-Objective Optimization Problems(MOPs) are very difficult to solve by traditional methods, so many Evolutionary Algorithms were designed to deal with them. In this paper, we discussed Multi-objective Evolutionary Algorithms(MOEAs) in engineering view, and proposed a new unified framework. According to the framework, we find some possible key points to the design of MOEAs and these key points are discussed. Then we introduce a new MOEA and test it with some famous benchmark functions. The numerical experiments show that the algorithm can obtain more non-dominant solutions which distribute equably and approximately to the Pareto front in less time than some algorithms such as SPEA2, NSGAII and HPMOEA. | |||
TO cite this article:Zheng Bojin ,Li Yuanxiang . Using Engineering View to Design Better Multi-objective Evolutionary Algorithms[OL].[30 November 2006] http://en.paper.edu.cn/en_releasepaper/content/10088 |
2. A Link Clustering Based Approach for Clustering Categorical Data | |||
He Zengyou,Xu Xiaofei,Deng Shengchun | |||
Mechanics 06 December 2004 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Categorical data clustering (CDC) and link clustering (LC) have been considered as separate research and application areas. The main focus of this paper is to investigate the commonalities between these two problems and the uses of these commonalities for the creation of new clustering algorithms for categorical data based on cross-fertilization between the two disjoint research fields. More precisely, we formally transform the CDC problem into an LC problem, and apply LC approach for clustering categorical data. Experimental results on real datasets show that LC based clustering method is competitive with existing CDC algorithms with respect to clustering accuracy. | |||
TO cite this article:He Zengyou,Xu Xiaofei,Deng Shengchun. A Link Clustering Based Approach for Clustering Categorical Data[OL].[ 6 December 2004] http://en.paper.edu.cn/en_releasepaper/content/1332 |
3. Modeling Complex Higher Order Patterns | |||
zengyou he,Xu Xiaofei,Deng Shengchun | |||
Mechanics 06 December 2004 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The goal of this paper is to show that generalizing the notion of frequent patterns can be useful in extending association analysis to more complex higher order patterns. To that end, we describe a general framework for modeling a complex pattern based on evaluating the interestingness of its sub-patterns. A key goal of any framework is to allow people to more easily express, explore, and communicate ideas, and hence, we illustrate how our framework can be used to describe a variety of commonly used patterns, such as frequent patterns, frequent closed patterns, indirect association patterns, hub patterns and authority patterns. To further illustrate the usefulness of the framework, we also present two new kinds of patterns that derived from the framework: clique pattern and bi-clique pattern and illustrate their practical use. | |||
TO cite this article:zengyou he,Xu Xiaofei,Deng Shengchun. Modeling Complex Higher Order Patterns[OL].[ 6 December 2004] http://en.paper.edu.cn/en_releasepaper/content/1330 |
4. C2S: A System for Optimizing Supply Chain Performance Based on Customer Data Analysis | |||
zengyou he,Xiaofei Xu,Shengchun Deng,Bin Dong | |||
Mechanics 29 October 2004 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:his paper aims at investigating the feasibility of optimizing supply chain performance by analyzing customer data using data mining techniques. In particular, it introduces the C2S system that performs this task. In C2S, the overall supply chain management performance is measured by end customer satisfaction. And the working sequences of C2S can be summarized as follows. Firstly, customers are segmented into different groups using clustering algorithm and actionable cluster-defining rules are derived for each cluster. Secondly, for each segment, the Customer Lifetime Value (CLV) is computed and Customer Requirements are acquired. According to the distinct customer requirements in different customer segments, the association mining approach is employed to find possible factors through whole supply chain that are relevant to these requirements, to help the decision maker in making feasible actions to satisfy customer requirements. Thereafter, we can define the supply chain performance o | |||
TO cite this article:zengyou he,Xiaofei Xu,Shengchun Deng, et al. C2S: A System for Optimizing Supply Chain Performance Based on Customer Data Analysis[OL].[29 October 2004] http://en.paper.edu.cn/en_releasepaper/content/1182 |
5. AUTOMATIC RE-ORGANIZATION OF GROUP-WISED WEB COURSEWARE | |||
tangchangjie,Rynson W.H.,Qing Li,Tianqing Zhang,Danny Kilis | |||
Mechanics 06 July 2004 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:With the increasing popularity of the Internet, there is a growing demand for web-based education, which allows students to study and learn at their own pace over the Internet. However in order to improve the teaching quality, such systems should be able to adapt the teaching in accordance with individual students’ ability and progress. Focusing on this objective, this paper proposes a new method to construct group-wised courseware by mining both context and structure of the courseware to build personalized web tutor trees. To this end, the concept of web tutor units and the notion of similarity are presented. Five algorithms, including the Naive Algorithm for tutor concept tree and the Level-generate Algorithm to generate web tutor units of K+1 levels are proposed. Experimental results are presented to demonstrate the effectiveness of the new method. | |||
TO cite this article:tangchangjie,Rynson W.H.,Qing Li, et al. AUTOMATIC RE-ORGANIZATION OF GROUP-WISED WEB COURSEWARE[OL].[ 6 July 2004] http://en.paper.edu.cn/en_releasepaper/content/895 |
6. Mining Predicate Association Rule by Gene Expression Programming | |||
Zuo Jie,tangchangjie,zhangtianqing | |||
Mechanics 01 July 2004 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract: Gene expression programming (GEP) is a new technique in genetic computing introduced in 2001. Association rule mining is a typical task in data mining. In this article, a new concept called Predicate Association (PA) is introduced and a new method to discover PA by GEP, called PAGEP (mining Predicate Association by GEP), is proposed. Main results are: (1) The inherent weaknesses of traditional association (TA) are explored. It is proved that TA is a special case of PA. (2) The algorithms for mining PAR, decoding chromosome and fitness are proposed and implemented. (3) It is also proved that gene decoding procedure always success for any well-defined gene. (4) Extensive experiments are given to demonstrate that PAGEP can discover some association rule that cannot be expressed and discovered by traditional method. | |||
TO cite this article:Zuo Jie,tangchangjie,zhangtianqing. Mining Predicate Association Rule by Gene Expression Programming [OL].[ 1 July 2004] http://en.paper.edu.cn/en_releasepaper/content/878 |
7. Time Series Prediction based on Gene Expression Programming | |||
Zuo Jie,Tangchangjie,Lichaun,Chen au-long,Yuan Chang-an | |||
Mechanics 28 June 2004 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Time series prediction is a typical and significant task in data mining, which has been widely studied recently. This paper proposes two novel methods for Time Series Prediction based on GEP (Gene Expression Programming). The main contributions are as follows: (1) GEP-Sliding Window Prediction Method (GEP-SWPM) to mine the relationship between future and history data directly. (2) GEP-Differential Equation Prediction Method (GEP-DEPM) to mine ordinary differential equation from training data, and predicts future trends based on specified initial conditions. (3) A brand new data preprocessing method, called Differential by Microscope Interpolation (DMI) that boosts the effectivity of our methods. (4) A new simple and effective GEP-constants generation method called Meta-Constants (MC) is also proposed. Extensive experiments on real data sets for sun spot prediction show that the performance of the new method is 10-200 times higher than existing algorithms. | |||
TO cite this article:Zuo Jie,Tangchangjie,Lichaun, et al. Time Series Prediction based on Gene Expression Programming[OL].[28 June 2004] http://en.paper.edu.cn/en_releasepaper/content/867 |
8. Temporal-based Multi-Strokes Sketchy Graphics Recognition | |||
Yin Jian Feng,Sun Zheng Xing | |||
Mechanics 20 May 2004 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this paper, we present a multi-strokes sketchy graphics recognition method, which make user of temporal information of sketching. The main idea includes two aspects: temporal-based stroke segmentation and temporal-based user modeling. The former means that the input stroke is emendated into primitive shapes such as lines, arcs, circles and ellipses, etc., based on pen speed and stroke curvature. The later indicates that a users’ sketching model are constructed and adjusted dynamically based on temporal order of primitive shapes. The experiments have proved the high efficiency. | |||
TO cite this article:Yin Jian Feng,Sun Zheng Xing. Temporal-based Multi-Strokes Sketchy Graphics Recognition[OL].[20 May 2004] http://en.paper.edu.cn/en_releasepaper/content/706 |
9. SPATIAL STYLES CAPTURING USING GENETIC ALGORITHMS | |||
Zhang Li Sha,Sun Zheng Xing | |||
Mechanics 20 May 2004 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Many sketches convey information through the relationships between graphics, rather than the internal structure of the graphics themselves, and the spatial context of a sketch should help people to understand freehand sketches. In this paper, we exploit a method of the spatial styles capturing based on genetic algorithms (GAs) for sketch-based software conceptual modeling. Firstly, a structures of object relation graphs(ORGs) is constructed based on the definition of the spatial styles in UML. Secondly, a computational model is employed to describe the interrelation of sketchy UML objects and capture frequently occurred spatial styles possibly with fixed semantics through genetic algorithms. Experiments have proved the proposed method both effective and efficient. | |||
TO cite this article:Zhang Li Sha,Sun Zheng Xing. SPATIAL STYLES CAPTURING USING GENETIC ALGORITHMS[OL].[20 May 2004] http://en.paper.edu.cn/en_releasepaper/content/702 |
10. Sketchy Shape Recognition Based on Relevance Feedback | |||
Wang Qiang,Sun Zheng Xing | |||
Mechanics 18 May 2004 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Sketching is an efficient way for recording and conveying ideas, especially in the early stages of design and idea externalizing. Main challenge in this area comes from the ambiguity of sketch. In this paper, we introduce a method of freehand sketchy shape recognition, in which we adapt the relevance feedback for sketchy shapes recognition to capturing user’s intents. Firstly, the candidate sketchy objects are extracted by means of similarity calculation, based on the establishment of feature-based vector model of freehand sketches. Secondly, the relevance feedback are used to capture the users’ input intends and refine the recognition results incrementally by rebuilding the vector and re-weighting the feature-based vector model alone with the user’s relevance judgement. Experiments prove the proposed method both effective and efficient. | |||
TO cite this article:Wang Qiang,Sun Zheng Xing. Sketchy Shape Recognition Based on Relevance Feedback[OL].[18 May 2004] http://en.paper.edu.cn/en_releasepaper/content/698 |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated