Learning activity sequencing in personalized education system

Personalized education provides an open learning environment which enriches the advanced technologies to establish a paradigm shift, active and dynamic teaching and learning patterns. E-learning has a various established approaches to the creation and sequencing of content-based, single learner, and self-paced learning objects. However, there is little understanding of how to create sequences of learning activities which involve groups of learners interacting within a structured set of collaborative environments. In this paper, we present an approach for learning activity sequencing based on ontology and activity graph in personalized education system. Modeling and management of learning activity and learner are depicted, and an algorithm is proposed to realize learning activity sequencing and learner ontology dynamically updating.     

远程教育中基于粗糙集的聚类算法

针对目前远程教育中个性化教学水平较低的问题,提出了一种基于粗糙集的Web学习者聚类算法,并应用粗糙集的约简方法解决了学习者特征数据中的属性冗余问题,提高了聚类算法的效率,从而提高了远程教学网站的个性化教学水平.     

面向虚拟学习社区的学习行为特征挖掘与分组方法的研究

虚拟学习社区作为网络教育的一种新兴模式,越来越受到人们的关注.如何为不同的学习者提供良好的个性化教学服务是虚拟学习社区研究的重要问题,而学习者的学习特征的提取与分析是个性化教学的基础.以虚拟学习社区为背景,从学习者的学习过程和学习特征入手,运用模糊c均值聚类算法(FCM)挖掘并分析学习过程中学习者的学习特征,进而根据学习者的知识水平、自主学习和协作学习积极性等学习特征进行精确分组划分,以达有针对性的教学指导,实现个性化教学,提高学习者学习效率.     

Incremental Web Usage Mining Based on Active Ant Colony Clustering

To alleviate the scalability problem caused by the increasing Web using and changing users＇ interests, this paper presents a novel Web Usage Mining algorithm-Incremental Web Usage Mining algorithm based on Active Ant Colony Clustering. Firstly, an active movement strategy about direction selection and speed, different with the positive strategy employed by other Ant Colony Clustering algorithms, is proposed to construct an Active Ant Colony Clustering algorithm, which avoid the idle and ＂flying over the plane＂ moving phenomenon, effectively improve the quality and speed of clustering on large dataset. Then a mechanism of decomposing clusters based on above methods is introduced to form new clusters when users＇ interests change. Empirical studies on a real Web dataset show the active ant colony clustering algorithm has better performance than the previous algorithms, and the incremental approach based on the proposed mechanism can efficiently implement incremental Web usage mining.     

A New Framework for Focused Web Crawling

Focused crawlers are important tools to support applications such as specialized Web portals, online searching, and Web search engines. A topic driven crawler chooses the best URLs and relevant pages to pursue during Web crawling. It is difficult to deal with irrelevant pages. This paper presents a novel focused crawler framework. In our focused crawler, we propose a method to overcome some of the limitations of dealing with the irrelevant pages. We also introduce the implementation of our focused crawler and present some important metrics and an evaluation function for ranking pages relevance. The experimental result shows that our crawler can obtain more ＂important＂ pages and has a high precision and recall value.     

A New Feature Selection Method for Text Clustering

Feature selection methods have been successfully applied to text categorization but seldom applied to text clustering due to the unavailability of class label information. In this paper, a new feature selection method for text clustering based on expectation maximization and cluster validity is proposed. It uses supervised feature selection method on the intermediate clustering result which is generated during iterative clustering to do feature selection for text clustering; meanwhile, the Davies-Bouldin＇s index is used to evaluate the intermediate feature subsets indirectly. Then feature subsets are selected according to the curve of the Davies-Bouldin＇s index. Experiment is carried out on several popular datasets and the results show the advantages of the proposed method.     

Web Database Query Interface Annotation Based on User Collaboration

A vision based query interface annotation meth od is used to relate attributes and form elements in form based web query interfaces, this method can reach accuracy of 82%. And a user participation method is used to tune the result; user can answer ＂yes＂ or ＂no＂ for existing annotations, or manually annotate form elements. Mass feedback is added to the annotation algorithm to produce more accurate result. By this approach, query interface annotation can reach a perfect accuracy.     

ISTC： A New Method for Clustering Search Results

A new common phrase scoring method is proposed according to term frequency-inverse document frequency （TFIDF） and independence of the phrase. Combining the two properties can help identify more reasonable common phrases, which improve the accuracy of clustering. Also, the equation to measure the in-dependence of a phrase is proposed in this paper. The new algorithm which improves suffix tree clustering algorithm （STC） is named as improved suffix tree clustering （ISTC）. To validate the proposed algorithm, a prototype system is implemented and used to cluster several groups of web search results obtained from Google search engine. Experimental results show that the improved algorithm offers higher accuracy than traditional suffix tree clustering.     

基于Web Service的E-learning系统架构

提出构建面向服务的E-learning系统,以实现高端系统对于系统兼容性,松散耦合性等特性的要求.该系统为所有学习组件提供了一个灵活的集成模型.使用该模型,学习服务提供方可以在服务中介发布学习对象与应用,而学习服务需求者可以在服务中介处查询这些服务,进而与服务的提供方进行绑定调用服务.面向Web Service的E-learning系统因其良好的集成性,互操作性,重用性等优势而成为E-learning系统发展的一个新趋势.     

A Novel Incremental Mining Algorithm of Frequent Patterns for Web Usage Mining

Because data warehouse is frequently changing, incremental data leads to old knowledge which is mined formerly unavailable. In order to maintain the discovered knowledge and patterns dynamically, this study presents a novel algorithm updating for global frequent patterns-IPARUC. A rapid clustering method is introduced to divide database into n parts in IPARUC firstly, where the data are similar in the same part. Then, the nodes in the tree are adjusted dynamically in inserting process by ＂pruning and laying back＂ to keep the frequency descending order so that they can be shared to approaching optimization. Finally local frequent itemsets mined from each local dataset are merged into global frequent itemsets. The results of experimental study are very encouraging. It is obvious from experiment that IPARUC is more effective and efficient than other two contrastive methods. Furthermore, there is significant application potential to a prototype of Web log Analyzer in web usage mining that can help us to discover useful knowledge effectively, even help managers making decision.     

Construction of domain Web classification ontology based on suggested upper merged ontology

Aiming at the problem of merging heterogeneous semantic taxonomy emerged in Web information integration, a method of building Web classification ontology （WCO） has been proposed. A WCO that is logically consistent with the suggested upper merged ontology （SUMO） is defined, together with axioms needed to classify Web pages. WCO can be used as a foundation of merging heterogeneous semantic taxonomy, and could be used to support Web information integration and classification based Web information retrieval.     

基于学习风格理论的网络教学模型构建

就网络教学的本质和技术特质而言,网络教学的目的是为学习者提供一种不受时空限制的个性化教学,但网络教育忽略了学习者的个体差异,从而影响了网络教育的质量．通过分析学习风格理论与网络教育的特殊性及学习者的个性特征的关系,提出并构建了运用学习风格理论的网络教育个性化模型,以对网络教学实践有一定的启示,真正实现网络教育的个性化．     

Involvement of Oxidative Stress and Down-Regulation of Bcl-2 in Arachidonic Acid-Induced Apoptosis in HUVECs

0IntroductionAraacicdhi,diosn fiocu ancidd p(reAdAo)m i,naanntelsys eantt itahle p sonl-y2u npsoastiutiroante doff actetl-ylular phospholipids . Normal free AAconcentrationin humanblood ranges from5 .8μmol/Lto 49 .3μmol/L[1].It is re-leased mostlythroughactivation of phospholipase A2by physi-ological and pathological sti muli[2]. Free AAcan be metabo-lizedinto various eicosanoids via specific enzymes such as cy-clooxygenases ( COX) , lipoxygenase and cytochromesP-450[3]. During AA met…     

Concept association and hierarchical Hamming clustering model in text classification

We propose two models in this paper. The concept of association model is put forward to obtain the co-occurrence relationships among keywords in the documents and the hierarchical Hamming clustering model is used to reduce the dimensionality of the category feature vector space which can solve the problem of the extremely high dimensionality of the documents~ feature space. The results of experiment indicate that it can obtain the co-occurrence relations among keywords in the documents which promote the recall of classification system effectively. The hierarchical Hamming clustering model can reduce the dimensionality of the category feature vector efficiently, the size of the vector space is only about 10% of the primary dimensionality.     

E-learning环境下的个性化学习行为研究

随着信息化社会的快速发展,基于互联网技术的网络教育逐渐成为一种有效利用社会教育资源、促进学习化社会构建的积极途径.E-learning使学习不再受到时间和空间的限制,令学习者获取知识和信息的方式发生了巨大变化.笔者针对当前在E-learning的应用与实践中存在的个性化服务方面的不足,提出对E-learning环境中的学习者主体的学习行为、学习兴趣度进行分析和研究的方法,为建立基于E-learning的网络个性化教学体系提供有力的理论依据.     

An ontology reasoning architecture for data mining knowledge management

In order to realize the intelligent management of data mining （DM） domain knowledge, this paper presents an architecture for DM knowledge management based on ontology. Using ontology database, this architecture can realize intelligent knowledge retrieval and automatic accomplishment of DM tasks by means of ontology services. Its key features include：①Describing DM ontology and meta-data using ontology based on Web ontology language （OWL）.② Ontology reasoning function. Based on the existing concepts and relations, the hidden knowledge in ontology can be obtained using the reasoning engine. This paper mainly focuses on the construction of DM ontology and the reasoning of DM ontology based on OWL DL（s）.     

Extracting the Cores of Implicit Communities

In this paper, we improve the trawling and point out some communities missed by trawling. We use the DBG （Dense Bipartite Graph） to identify a structure of a potential community instead of CBG （Complete Bipartite Graph）. Based on DBG, we proposed a new method based on edge removal to extract cores from a web graph. Moreover, we improve the crawler to save only potential pages as fans of a core and save a lot of disk storage space. To evaluate the set of cores whether or not belong to a community, the statistics of term frequency is used. In the paper, the dataset of experiment were crawled under domain ＂.cn＂. The result show that the our algorithm works properly and some new cores can be found by our method.