A Decision Support System for Finding Research Topic based on Paper Recommendation

Size: px
Start display at page:

Download "A Decision Support System for Finding Research Topic based on Paper Recommendation"

Transcription

1 Association for Information Systems AIS Electronic Library (AISeL) PACIS 2013 Proceedings Pacific Asia Conference on Information Systems (PACIS) A Decision Support System for Finding Research Topic based on Paper Recommendation Li Yu Renmin University of China, buaayuli@ruc.edu.cn Jie Yang Renmin University of China, moon-knigth@qq.com Dong Yang Renmin University of China, yangdong519@126.com Xiaoping Yang Renmin University of China, yang@ruc.edu.cn Follow this and additional works at: Recommended Citation Yu, Li; Yang, Jie; Yang, Dong; and Yang, Xiaoping, "A Decision Support System for Finding Research Topic based on Paper Recommendation" (2013). PACIS 2013 Proceedings This material is brought to you by the Pacific Asia Conference on Information Systems (PACIS) at AIS Electronic Library (AISeL). It has been accepted for inclusion in PACIS 2013 Proceedings by an authorized administrator of AIS Electronic Library (AISeL). For more information, please contact elibrary@aisnet.org.

2 A DECISION SUPPORT SYSTEM FOR FINDING RESEARCH TOPIC BASED ON PAPER RECOMMENDATION Li Yu, School of Information, Renmin University of China, Beijing, P.R.China, State Key Laboratory of Digital Publishing Technology, Beijing, P.R.China, Jie Yang, School of Information, Renmin University of China, Beijing, P.R.China, Dong Yang, School of Information, Renmin University of China, Beijing, P.R.China, Xiaoping Yang, School of Information, Renmin University of China, Beijing, P.R.China, Abstract Finding a good research topic is very crucial for a researcher, especially a new researcher, such as PhD student. Generally, a PhD student s research interest in the beginning is not clear, and he have to spend much time reading a lot of research literatures, step by step, his research preference will become clearer and clearer, and easier to find an advanced research topic in which he is really interested. So, reading a certain number of research literatures is critical for a PhD student to find final research topic. But, which literature should be selected to read? How to quickly clear user preference and determine final research topic by reading fewest literatures? As far as we known, there is no system used to support the user to find research topic. In the paper, a research topic decision support system is originally proposed and creatively developed to help a user to quickly find potential research topic based on iteratively paper recommendation. Starting from user s initial unclear research preference, through continuous recommending appropriate literatures to the user, then the user read and critiques them by rating until he find final research topic. During the process, since the user read the most appropriate literature in each round, he can quickly find the research topic while spending minimal time. Keywords: Decision Support System, Recommender System, Human Computer Interaction, Research

3 1. INTRODUCTION Finding a good research topic is very crucial to a researcher, especially a new researcher, such as master student and PhD student. According to the statistic, there new master students are admitted each year in China. That is to say, there so many students need to find their interesting research topic for their degree thesis every year. But how they find their interesting research topic? In general, by focusing on their tutor s research field, the students select special research topic according to their interests after reading a lot of related literatures. Unfortunately, many graduated students are force to re-select another research topic owing to various reasons. For example, after making research for a several months, it is found that the selected research topic has been studied by other researcher, or the selected research topic is not enough original and novel. The most important reason is that they do not read enough appropriate literature during the process of selecting research topic. It is true that re-selecting a new research topic will delay their graduation. In this paper, a research topic decision support system is originally proposed and creatively developed to help a user to quickly find his research topic based on iteratively paper recommendation. The proposed system recommends most appropriate literatures to the graduated students, and then the students provide their feedback after they read recommended literatures. Based on their feedback, the system recommends most appropriate literature to the students once again. After many times repeatedly like this, the system will recommend the students appropriate and comprehensive related literatures suited to students interests according to the feedbacks. And the system will helping our students rapidly find their interests and research field that he is really interested in, eventually to help students rapidly determine their research topic. The rest of the paper is organized as follows. Some related techniques and works are summarized in next section. In section 3, the system framework is proposed. A lot of key issues in the system are detail in section 4, such as how to acquire and update user preference and how to recommend literature. In section 5, prototype system is developed in section 5. Finally, conclusions are given and further researches are discussed. 2. RELATED WORKS Firstly, information retrieve is the most widely used in literature retrieve and recommendation, it returns corresponding results according to keyword inputted by user. Also, citation analysis is also widely used in literature retrieve field (Gipp & Beel 2009; Matsatsinis etc al. 2007), which is based on the hypothesis that if a paper is quoted by another paper, then two papers are similar about content to a certain extent. Other literatures recommendation methods include journal impact factor, author association, keywords analysis (Vellino2009; Watanabe etc al.2005). Although a lot retrieve techniques are widely used in almost every literature database and digital library, but more strictly speaking, they are not personalized recommendation techniques in the strict sense. The strictly recommendation was first studied by Resnick and Varian. Since then, a lot of researches are made in this field (Vellino 2009; Rolando 2006; Dmitry 2013). Current researches on recommendation share following common characteristics. First, there exists an implied hypothesis in current research that user customer s preference must be clear in order to succeed recommend. Sometimes users preferences are explicit while their preferences are implicit. If there have users implicit preference, data mining method should be used to get their preference. Secondly, the objective of traditional literature recommender system is only to give a recommended literature list, not to help users to complete a task. Thirdly, core pare of current literature recommendation system is recommendation algorithm. Numerous research works are dedicated to this field. Collaborative filtering recommendation (Pu 2006) is most widely studied, especially several famous problem, such as sparsity, cold-starting etc. In addition, other recommendation methods include content-based recommendation, knowledge based recommendation, association rule based recommendation, and

4 hybrid techniques mixed other algorithms. Seeing from the view of technology, the purpose of information retrieve is the maximize similarity degree between retrieved literatures and inputted keywords by users. In practice, a new researcher, such as PhD candidate students, it is impossible to clearly know special keywords corresponding to their future research topic. In summary, although information retrieve technology and recommendation technology are the core technologies in the process of selecting research topic, they are hard to directly be used to find research topic for PhD candidate students. There are two reasons. Firstly, users preferences are unclear or at least non-specific at the beginning phase. Secondly, recommended literatures for finding research are not only associate with users preferences, but also associated with the some characteristics of literatures, such as publication date, authoritative, journal grade and so on. In recent years, conversational recommender system emerged to clear users preferences based on conversation between users and system in order to improve accuracy of recommendation (Rachael R. & Barry 2005; Ricci & Nguyen 2008; Rolando 2012). For example, Ricci made research on shopping recommendation in the environment of mobile business by the method of critique (Ricci & Mahmood 2007; Ni etc al. 2012) while Mark studies shopping recommendation based on customer scenarios information which were produced by meeting alternately feedback, such as location, time, weather and so on. Overall, there is very few about selecting research topic. 3. SYSTEM FRAMEWORKS 3.1 Research Scenario In this paper, our work is to develop a decision support system for finding research topic based on literature recommendation. Our research scenario can be illustrated through the following study case. Kai WANG is a new PhD candidate student admitted by department of computer science in ABC University. His advisor is professor Li, well known in data mining field. On the first day when Kai WANG begins his PhD study, Professor Li talks with Kai WANG about selecting research topic for PhD thesis. Professor Li said he will not give Kai WANG a special topic as the title of his future PhD thesis because professor Li hope to give Kai WANG more freedom to find an interesting research topic in which Kai WANG is also really interested. But the research topic is related to data mining because professor Li is an expert in data mining, and he will provide Kai WANG with more guidance during his research. Also, professor Li require Kai WANG read a lot of literatures before he determine final research topic. So Kai WANG searches paper by the keyword data mining in the literature database. Unfortunately, one and half of year later, although WANG read 80 papers retrieved in literature database, he still did not find his research topic because there are so many research directions and more than one million literatures related to data mining in literature database. In fact, although WANG read more than 80 literatures, many literatures are similar, and some literatures have no much reference value for other reasons, such as too old, not authority. If doing as the current speed, WANG think he can read 300 literatures at most, and he still cannot determine research topic after four years. For this reason, WANG is very anxious. So, he very hopes there is a system to support him in finding research topic. By the help of system, WANG will quickly find research topic through reading the fewest literatures. Our research in the paper is devoted to developing this kind of system for helping WANG to quickly find research topic through reading the fewest literatures. 3.2 System Frameworks In order to help WANG to quickly find research topic through reading the fewest literatures, the most key idea is to recommend the most appropriate literature to WANG at appropriate time. The system framework of our proposed system is described in Figure 1. In the beginning, WANG put into his

5 initial blurred preferences with the keyword data mining, and then the system will recommend WANG five representative papers retrieved in literature database based on his initial blurred preferences. After reading the five classical papers, WANG will know the directions related to data mining field to some degree, and he will has more clear preference. Then, WANG is required to clique this five papers by rating according to the following visual angle, such as whether the paper is enough new, or whether he is interested, or whether the paper is beneficial to finding research topic. At the same time, WANG is also allowed to input new keywords in which he is interested. Based on new inputted keywords and his critiquing for recommended papers, the system will recommend another five most appropriate papers once again. In general, newly recommended papers are more special and are more interesting to WANG. In fact, these newly recommended papers are also more focused. Step by Step, after many iterations, WANG will has more clear research preference till he think the research topic is found. In fact, if the recommended literature is enough focused, it is reasonable to think that WANG find research topic. Under this condition, the system will stop. Initial Keywords Literature Database Updating User Preference based on feedbacks Generate recommended literatures Clique recommended literatures No Whether topic is found? End Yes Figure 1. System Framework User preference is acquired by following learning processes, as shown is Figure KEY TECHNIQUE ISSUES In order to implement the system, there are some key technique issues, including getting and updating user preference, recommending literature based updated research preference, and regarding when to end work. 4.1 How to get user s research preference

6 Because user s research preference is not clear in the beginning, it is very key to get and clear user s preference. In proposed system, there are two kinds of methods to get user s preference, respectively explicit keywords and implicit critique. Initial Preference Recommend Recommended Literatures Critique User Updated Preference Updating Preference Feedback information Figure 2. User Preference Learning Explicit Keywords At any time, the user is allowed to input his interesting keywords to express his research preference. At the beginning, the user generally has very vague preference, explicitly inputted keywords is important for user. For example, in above research scenario case in section 3.1, WANG has a rough preference in data mining field. So, WANG can only input data mining as keyword. In the later, additional keywords can be inputted again till the user finds his research interesting topic Implicit Critique In general, a PhD candidate is hard to have explicit and special keyword preferences because he does not know well about a certain field. That is to say, he does not know which keywords are his explicit preferences. But he can critique them by rating according to his implicit research preference if some papers are recommended to him. In proposed system, the user is allowed to implicitly critique by rating recommended papers, respectively with Very Interested (1.0), Interested (0.8), Normal (0.5), Little Interested (0.2) and No Interested (0). 4.2 Updating User Preference Another important issue is how to learn and update user preference based on explicit keywords and implicit critiquing at each iteration. In the proposed system, user research preferences are updated though following three steps. Step 1:Summarize preference on critiqued papers as critiqued preference. For recommended paper set P at each round, the user will be required to critique them by rating. Based on critiquing, each keyword in each critiqued paper will be assigned a weight to measure its importance in user s preference. For each keyword appeared in anyone of all critiqued papers, its whole weight will be computed by weightily summing its weight in all critiqued papers. All keyword and their whole weight at certain round forms user critiqued preference at this round. Step 2:Integrate critiqued preference with explicitly inputted keywords as added preference. Including critiquing paper, a user is also allowed to input new keywords to explicitly express his

7 preference when he has more clear preference on his future research topic. It is called as keyword preference in this paper. And both keyword preference and critiqued preference are assigned different weight to show their importance for generating added preference. Specially, critiqued preference is assigned with weight α while keyword preference is assigned with weight (1-α). Formally, Added_Prefer(u)= α*critiqued_prefer(u)+ (1-α)*Keyword_Prefer(u) (1) Step 3:Combine old preference with added preference to generate candidate updated preference. Once added preference is generated, it will be used to update user preference by combining with user old preference. In proposed method, added preference is assigned with weight β while old preference is assigned with weight (1-β). More the weight β is, more important the added preference is for generating candidate user preference. Formally, Cand_Updated_Prefer(u)= β*added_prefer(u)+ (1-β)*Old_Prefer(u) (2) Step 4:Shorten candidate updated preference to final updated preference. For candidate updated preference, there are a lot of preference keywords with very little value. These preference keywords have not much role in describing user preference, in order to simplify compute, all keywords are descendingly sorted by their value. Once accumulated value is over 0.9, surplus keywords are neglected. Final updated preference is generated by accumulated keywords. Then, their value is standardized. In the following, an example is given to illustrate above proposed method. In this example, it is supposed that user old preference is shown in Table 1. Preference Keywords Value Personalized Recommendation 0.4 Recommender System 0.2 Data Mining 0.3 Collaborative Filtering 0.1 Table 1. Old preference Based on above user preference, there some papers are recommended to the user. After the user read these papers, he gives his feedback by critiquing them though rating as shown in the following Table 2. Paper 1 Paper 2 Paper 3 Keywords of Critiqued Papers Recommender System, Collaborative Filtering, Recommendation based on Content Data Mining, Associate Rule, Personalized Recommendation Collaborative Filtering, Knowledge Filtering, Recommender System Rating Very Interested (1) Normal (0.5) Little Interested (0.2) Table 2. Critique by rating recommended paper Including his critiquing on recommended paper, the user also input interested keywords as shown in the following Table 3. E-Commerce, Recommender System, Collaborative Filtering

8 Table 3. Explicit inputted keywords In order to update user preference, added preference is generated by integrating critiqued preference and newly inputted keywords. In this paper, weight α is set as 0.6 and weight β is set as 0.3. According to the equation (1), added preference is shown in following, Preference Keywords Value Recommender System Collaborative Filtering E-Commerce Recommendation based on Content Data Mining Associate Rule Personalized Recommendation Knowledge Filtering Table 4. Added preference Similarly, according to equation (2), candidate updated preference is computed by combining added preference with old preference, as shown in the following Table 5. Preference Keywords Value Recommender System Collaborative Filtering E-Commerce Recommendation based on Content Data Mining Associate Rule Personalized Recommendation Knowledge Filtering Table 5. Candidate updated preference Then order all preference keyword by their value. When accumulated value is over 0.9, surplus keywords is neglected. Final updated preference is generated by accumulated keywords. Then, their value is standardized, as shown in Table 6. So, final updated preference at this iteration is shown in Table 7. Preference Keywords Order Value Accumulated Personalized Recommendation

9 Data Mining Collaborative Filtering Recommender System E-Commerce Recommendation based on Content Associate Rule Knowledge Filtering Table 6. Order and Accumulative preference Preference Keywords Accumulated Personalized Recommendation Data Mining Collaborative Filtering Recommender System Table 7. Final updated preference 4.3 Recommend Literature Once user updated preference is generated at certain iteration, it is used to recommend literatures for user to read. For each paper related to a field in literature database, its recommendation value is computed. In our proposed method, listed keywords in each paper are considered to match user updated preference keywords. That is to say, if listed keywords list in a paper are more matched user updated preference keywords, then the paper has large recommendation value. Formally, all preference keywords set of user u is denoted as UP_KW while all listed keywords set in a paper is denoted as Pa_KW. For each keyword, its value in user preference is weight_user(a) while its value in a paper is denoted weight_pa(b) for each keyword. The weight weight_pa(b) is averaged by the number of listed keywords in a paper. That is to say, if there 4 keywords listed in a paper, then each keyword in the paper, the weight_pa(b) is equal to Based on above notation, for each paper, its recommendation value is computed as following equation, In the following, an example is given. Here it is supposed that user updated preference is shown in Table 8. Also there are two papers, and their listed keywords and recommendation value are following as shown in Table 8. Paper Listed Keywords in the paper Recommendation Value Paper 1 Recommender System, Collaborative Filtering, E-Commerce, Web * *0.25=0.100

10 Paper 2 Collaborative Filtering, Data Mining, Associate Rule 0.207* *0.333=0.156 Table 8. Two papers and their recommendation value 4.4 When to end work Once research topic is found, the system will end work. How to decide the research topic has been found? In our proposed system, two cases are set to decide research topic is found. The first one is that the system will automatically ends work once if the similarity between recommended literatures is over given threshold. In fact, if the similarity between recommended literatures is enough, it is considered that these recommended literatures are closely related to a certain topic, and it is reasonable to think that the user had found a topic. The topic which recommended literature detailed is the topic which the user wants to find and research. The second case is that the user may manually end work of system by pressing a button if the user thinks he had found research topic at any time. A user may select anyone case to end work of the system. 5. DEVELOPED PROTOTYPE SYSTEM In this section, a prototype system for finding research topic is developed. In current version, literature database used in prototype system is CNKI, which is a Chinese literature database. In order to begin to work, user is required to initially input interest field keyword, such as Database in Chinese, as shown in Figure 3. Figure 3. Initially input interest field keyword Once initial keyword is inputted, five classical literatures related to database field are recommended to the user to read, as shown in Figure 4. The similarity of all recommended papers is computed and user current preference is generated, as shown in Figure 5.

11 Figure 4. Recommended literatures Figure 5. Similarity of recommended literatures and current user preference For each recommended literature, the user can see its detailed information, such as author, keywords, published journal and abstract, as shown in Figure 6. Also, the paper can be directly downloaded. Figure 6. Detail information of recommended literature As shown in Figure 7, the user can critique recommended papers by rating them. Figure 7. Critique recommended literature by rating

12 When the similarity of recommended papers is large given threshold value 0.8 after many iterations, it is considered that the user have find the research topic. If the user thinks he cannot find research topic, he can press Go On to let the system continue work, as shown in Figure 8. Figure 8. Paper similarity is larger given threshold 6. CONCLUSION To find a good research topic is very crucial for a researcher as soon as possible, especially a new researcher, such as PhD student. Although information retrieve techniques, recommendation techniques etc. are important to get some useful literature recommendation if users preference is clear, they could not help users to seek a research topic when his research is not clear. In this paper, a novel system is proposed to help a user to quickly find research topic based on paper recommendation even the user s research preference is not clear. Starting from user s initial unclear research preference, through continuous recommending appropriate literature to the user, then the user read and critiques them by rating until the user find the final research topic. During the process, since the user read the most appropriate literature in each round, he can quickly find the research topic by spending minimal time. Although a research topic decision support system is originally proposed and creatively developed, there still have a lot of work to be done for further improving its performance and accuracy in the future. For example, it is better if the similarity between keywords is computed based on their semantics than simply matching of keywords. ACKNOWLEDGEMENTS This work was supported by National Natural Science Foundation of China(No ), Beijing Natural Science Foundation(No ), Humanity and Social Science Youth Foundation of Ministry of Education of China(No.11YJC630268), the Opening Project of State Key Laboratory of Digital Publishing Technology, the Fundamental Research Funds for the Central Universities, and the Research Funds of Renmin University of China. References Dmitry, B. (2013). Semantic audio content-based music recommendation and visualization based on user preference examples. Information Processing and Management: an International Journal.Vol.49,Issue.1; January Garcia, I., Pajares, S., Sebastia, L. and Onaindia, E. (2012). Preference elicitation techniques for group recommender systems, Information Sciences, 189 (2012) Gipp, B. and Beel, J. (2009). Identifying related Documents for Research Paper Recommender by CPA and COA, Proceedings of the World Congress on Engineering and Computer Science, Vol I, WCECS 2009, October 20-22, 2009, San Francisco, USA Gipp, B., Beel, J. and Hentschel, C. (2009). Scienstein: A Research Paper Recommender System. In Proceedings of the International Conference on Emerging Trends in Computing (ICETiC 09), pp.

13 Matsatsinis, N. F., Lakiotaki, K. and Delias, P. (2007). A System based on Multiple Criteria Analysis for Scientific Paper Recommendation, 11th Panhellenic Conference on Informatics (PCI 2007), May 18-20, Patras, Greece Marco, D. G. (2009). Preference Learning in Recommender Systems, In Preference Learning (PL-09) ECML/PKDD, 2009 Ni, X.L., Lu, Y., Quan, X.J., Liu, W.Y. and Hua, B. (2012). User interest modeling and its application for question recommendation in user-interactive question answering systems.information Processing & Management, Vol.48,Iss.2;p Mar2012. Pu, P. and Kumar P. (2004). Evaluating Example-based Search Tools. In ACM Conference on Electronic Commerce (EC'04), May 2004, New York, USA. Rachael R. and Barry S. (2005). Conversational Collaborative Recommendation An Experimental Analysis, Artificial Intelligence Review, (24) Springer 2005 Ricci F. and Mahmood T. (2007). Learning and adaptivity in interactive recommender systems, In Proceedings of the Ninth International Conference on Electronic Commerce, University of Minnesota, Minneapolis, MN, US, August Ricci, F. and Nguyen, Q.N. (2008). Acquiring and revising preferences in a critique-based mobile recommender system. IEEE Intelligent Systems, 22(3):22-29, 2008 Rolando, E. (2012). Implicit feedback techniques on recommender systems applied to electronic books, Computers in Human Behavior, 28 (2012) Vellino, A. (2009). Recommending Journal Articles with PageRankRatings, 3rd ACM Conference on Recommender Systems, 2009 Watanabe, S., Ito, T., Ozono, T. and Shintani, T. (2005). A Paper Recommendation Mechanism for the Research Support System, Proceedings of the International Workshop on Data Engineering Issues in E-Commerce, IEEE Computer Society, 2005, pp Zhao, L., Hu, N.J. and Zhang S.Z. (2002). Algorithm Design for Personalization Recommendation Systems. Journal of Computer Research and Development. Vol.39, No.8 Aug. 2002

Social Voting Techniques: A Comparison of the Methods Used for Explicit Feedback in Recommendation Systems

Social Voting Techniques: A Comparison of the Methods Used for Explicit Feedback in Recommendation Systems Special Issue on Computer Science and Software Engineering Social Voting Techniques: A Comparison of the Methods Used for Explicit Feedback in Recommendation Systems Edward Rolando Nuñez-Valdez 1, Juan

More information

Information Push Service of University Library in Network and Information Age

Information Push Service of University Library in Network and Information Age 2013 International Conference on Advances in Social Science, Humanities, and Management (ASSHM 2013) Information Push Service of University Library in Network and Information Age Song Deng 1 and Jun Wang

More information

An Improved Frequent Pattern-growth Algorithm Based on Decomposition of the Transaction Database

An Improved Frequent Pattern-growth Algorithm Based on Decomposition of the Transaction Database Algorithm Based on Decomposition of the Transaction Database 1 School of Management Science and Engineering, Shandong Normal University,Jinan, 250014,China E-mail:459132653@qq.com Fei Wei 2 School of Management

More information

An Adaptive Threshold LBP Algorithm for Face Recognition

An Adaptive Threshold LBP Algorithm for Face Recognition An Adaptive Threshold LBP Algorithm for Face Recognition Xiaoping Jiang 1, Chuyu Guo 1,*, Hua Zhang 1, and Chenghua Li 1 1 College of Electronics and Information Engineering, Hubei Key Laboratory of Intelligent

More information

Minimal Test Cost Feature Selection with Positive Region Constraint

Minimal Test Cost Feature Selection with Positive Region Constraint Minimal Test Cost Feature Selection with Positive Region Constraint Jiabin Liu 1,2,FanMin 2,, Shujiao Liao 2, and William Zhu 2 1 Department of Computer Science, Sichuan University for Nationalities, Kangding

More information

Personalized Tour Planning System Based on User Interest Analysis

Personalized Tour Planning System Based on User Interest Analysis Personalized Tour Planning System Based on User Interest Analysis Benyu Zhang 1 Wenxin Li 1,2 and Zhuoqun Xu 1 1 Department of Computer Science & Technology Peking University, Beijing, China E-Mail: {zhangby,

More information

EFFICIENT ATTRIBUTE REDUCTION ALGORITHM

EFFICIENT ATTRIBUTE REDUCTION ALGORITHM EFFICIENT ATTRIBUTE REDUCTION ALGORITHM Zhongzhi Shi, Shaohui Liu, Zheng Zheng Institute Of Computing Technology,Chinese Academy of Sciences, Beijing, China Abstract: Key words: Efficiency of algorithms

More information

A Web Page Segmentation Method by using Headlines to Web Contents as Separators and its Evaluations

A Web Page Segmentation Method by using Headlines to Web Contents as Separators and its Evaluations IJCSNS International Journal of Computer Science and Network Security, VOL.13 No.1, January 2013 1 A Web Page Segmentation Method by using Headlines to Web Contents as Separators and its Evaluations Hiroyuki

More information

Research on Community Structure in Bus Transport Networks

Research on Community Structure in Bus Transport Networks Commun. Theor. Phys. (Beijing, China) 52 (2009) pp. 1025 1030 c Chinese Physical Society and IOP Publishing Ltd Vol. 52, No. 6, December 15, 2009 Research on Community Structure in Bus Transport Networks

More information

WEB PAGE RE-RANKING TECHNIQUE IN SEARCH ENGINE

WEB PAGE RE-RANKING TECHNIQUE IN SEARCH ENGINE WEB PAGE RE-RANKING TECHNIQUE IN SEARCH ENGINE Ms.S.Muthukakshmi 1, R. Surya 2, M. Umira Taj 3 Assistant Professor, Department of Information Technology, Sri Krishna College of Technology, Kovaipudur,

More information

Learning to Match. Jun Xu, Zhengdong Lu, Tianqi Chen, Hang Li

Learning to Match. Jun Xu, Zhengdong Lu, Tianqi Chen, Hang Li Learning to Match Jun Xu, Zhengdong Lu, Tianqi Chen, Hang Li 1. Introduction The main tasks in many applications can be formalized as matching between heterogeneous objects, including search, recommendation,

More information

Efficient Common Items Extraction from Multiple Sorted Lists

Efficient Common Items Extraction from Multiple Sorted Lists 00 th International Asia-Pacific Web Conference Efficient Common Items Extraction from Multiple Sorted Lists Wei Lu,, Chuitian Rong,, Jinchuan Chen, Xiaoyong Du,, Gabriel Pui Cheong Fung, Xiaofang Zhou

More information

QoS Routing and Traffic Scheduling in Long-Distance Wireless Mesh Networks

QoS Routing and Traffic Scheduling in Long-Distance Wireless Mesh Networks Chinese Journal of Electronics Vol.21, No.2, Apr. 2012 QoS Routing and Traffic Scheduling in Long-Distance 802.11 Wireless Mesh Networks ZHAO Zenghua 1,HEMing 1, ZHANG Jie 2 and ZHANG Lianfang 1 (1.School

More information

Open Access Apriori Algorithm Research Based on Map-Reduce in Cloud Computing Environments

Open Access Apriori Algorithm Research Based on Map-Reduce in Cloud Computing Environments Send Orders for Reprints to reprints@benthamscience.ae 368 The Open Automation and Control Systems Journal, 2014, 6, 368-373 Open Access Apriori Algorithm Research Based on Map-Reduce in Cloud Computing

More information

Improved Attack on Full-round Grain-128

Improved Attack on Full-round Grain-128 Improved Attack on Full-round Grain-128 Ximing Fu 1, and Xiaoyun Wang 1,2,3,4, and Jiazhe Chen 5, and Marc Stevens 6, and Xiaoyang Dong 2 1 Department of Computer Science and Technology, Tsinghua University,

More information

Application of Individualized Service System for Scientific and Technical Literature In Colleges and Universities

Application of Individualized Service System for Scientific and Technical Literature In Colleges and Universities Journal of Applied Science and Engineering Innovation, Vol.6, No.1, 2019, pp.26-30 ISSN (Print): 2331-9062 ISSN (Online): 2331-9070 Application of Individualized Service System for Scientific and Technical

More information

Ontology Molecule Theory-based Information Integrated Service for Agricultural Risk Management

Ontology Molecule Theory-based Information Integrated Service for Agricultural Risk Management 2154 JOURNAL OF SOFTWARE, VOL. 6, NO. 11, NOVEMBER 2011 Ontology Molecule Theory-based Information Integrated Service for Agricultural Risk Management Qin Pan College of Economics Management, Huazhong

More information

Arbee L.P. Chen ( 陳良弼 )

Arbee L.P. Chen ( 陳良弼 ) Arbee L.P. Chen ( 陳良弼 ) Asia University Taichung, Taiwan EDUCATION Phone: (04)23323456x1011 Email: arbee@asia.edu.tw - Ph.D. in Computer Engineering, Department of Electrical Engineering, University of

More information

High Capacity Reversible Watermarking Scheme for 2D Vector Maps

High Capacity Reversible Watermarking Scheme for 2D Vector Maps Scheme for 2D Vector Maps 1 Information Management Department, China National Petroleum Corporation, Beijing, 100007, China E-mail: jxw@petrochina.com.cn Mei Feng Research Institute of Petroleum Exploration

More information

Top-k Keyword Search Over Graphs Based On Backward Search

Top-k Keyword Search Over Graphs Based On Backward Search Top-k Keyword Search Over Graphs Based On Backward Search Jia-Hui Zeng, Jiu-Ming Huang, Shu-Qiang Yang 1College of Computer National University of Defense Technology, Changsha, China 2College of Computer

More information

Research on QR Code Image Pre-processing Algorithm under Complex Background

Research on QR Code Image Pre-processing Algorithm under Complex Background Scientific Journal of Information Engineering May 207, Volume 7, Issue, PP.-7 Research on QR Code Image Pre-processing Algorithm under Complex Background Lei Liu, Lin-li Zhou, Huifang Bao. Institute of

More information

Revising the MSIS 2016 Model Curriculum : Status Update and Panel Discussion

Revising the MSIS 2016 Model Curriculum : Status Update and Panel Discussion Association for Information Systems AIS Electronic Library (AISeL) 2015 Proceedings SIGED: IAIM Conference 2015 Revising the MSIS 2016 Model Curriculum : Status Update and Panel Discussion Heikki Topi

More information

Research on Computer Network Virtual Laboratory based on ASP.NET. JIA Xuebin 1, a

Research on Computer Network Virtual Laboratory based on ASP.NET. JIA Xuebin 1, a International Conference on Advances in Mechanical Engineering and Industrial Informatics (AMEII 2015) Research on Computer Network Virtual Laboratory based on ASP.NET JIA Xuebin 1, a 1 Department of Computer,

More information

An Intelligent Retrieval Platform for Distributional Agriculture Science and Technology Data

An Intelligent Retrieval Platform for Distributional Agriculture Science and Technology Data An Intelligent Retrieval Platform for Distributional Agriculture Science and Technology Data Xiaorong Yang 1,2, Wensheng Wang 1,2, Qingtian Zeng 3, and Nengfu Xie 1,2 1 Agriculture Information Institute,

More information

VisoLink: A User-Centric Social Relationship Mining

VisoLink: A User-Centric Social Relationship Mining VisoLink: A User-Centric Social Relationship Mining Lisa Fan and Botang Li Department of Computer Science, University of Regina Regina, Saskatchewan S4S 0A2 Canada {fan, li269}@cs.uregina.ca Abstract.

More information

FSRM Feedback Algorithm based on Learning Theory

FSRM Feedback Algorithm based on Learning Theory Send Orders for Reprints to reprints@benthamscience.ae The Open Cybernetics & Systemics Journal, 2015, 9, 699-703 699 FSRM Feedback Algorithm based on Learning Theory Open Access Zhang Shui-Li *, Dong

More information

Combining Review Text Content and Reviewer-Item Rating Matrix to Predict Review Rating

Combining Review Text Content and Reviewer-Item Rating Matrix to Predict Review Rating Combining Review Text Content and Reviewer-Item Rating Matrix to Predict Review Rating Dipak J Kakade, Nilesh P Sable Department of Computer Engineering, JSPM S Imperial College of Engg. And Research,

More information

Research and Improvement of Apriori Algorithm Based on Hadoop

Research and Improvement of Apriori Algorithm Based on Hadoop Research and Improvement of Apriori Algorithm Based on Hadoop Gao Pengfei a, Wang Jianguo b and Liu Pengcheng c School of Computer Science and Engineering Xi'an Technological University Xi'an, 710021,

More information

Research and Application of E-Commerce Recommendation System Based on Association Rules Algorithm

Research and Application of E-Commerce Recommendation System Based on Association Rules Algorithm Research and Application of E-Commerce Recommendation System Based on Association Rules Algorithm Qingting Zhu 1*, Haifeng Lu 2 and Xinliang Xu 3 1 School of Computer Science and Software Engineering,

More information

AN EFFICIENT DEADLOCK DETECTION AND RESOLUTION ALGORITHM FOR GENERALIZED DEADLOCKS. Wei Lu, Chengkai Yu, Weiwei Xing, Xiaoping Che and Yong Yang

AN EFFICIENT DEADLOCK DETECTION AND RESOLUTION ALGORITHM FOR GENERALIZED DEADLOCKS. Wei Lu, Chengkai Yu, Weiwei Xing, Xiaoping Che and Yong Yang International Journal of Innovative Computing, Information and Control ICIC International c 2017 ISSN 1349-4198 Volume 13, Number 2, April 2017 pp. 703 710 AN EFFICIENT DEADLOCK DETECTION AND RESOLUTION

More information

Construction of Knowledge Base for Automatic Indexing and Classification Based. on Chinese Library Classification

Construction of Knowledge Base for Automatic Indexing and Classification Based. on Chinese Library Classification Construction of Knowledge Base for Automatic Indexing and Classification Based on Chinese Library Classification Han-qing Hou, Chun-xiang Xue School of Information Science & Technology, Nanjing Agricultural

More information

Context-based Roles and Competencies of Data Curators in Supporting Data Lifecycle: Multi-Case Study in China

Context-based Roles and Competencies of Data Curators in Supporting Data Lifecycle: Multi-Case Study in China Submitted on: 29.05.2017 Context-based Roles and Competencies of Data Curators in Supporting Data Lifecycle: Multi-Case Study in China Zhenjia Fan Department of Information Resources Management, Business

More information

A Model of Machine Learning Based on User Preference of Attributes

A Model of Machine Learning Based on User Preference of Attributes 1 A Model of Machine Learning Based on User Preference of Attributes Yiyu Yao 1, Yan Zhao 1, Jue Wang 2 and Suqing Han 2 1 Department of Computer Science, University of Regina, Regina, Saskatchewan, Canada

More information

Oleksandr Kuzomin, Bohdan Tkachenko

Oleksandr Kuzomin, Bohdan Tkachenko International Journal "Information Technologies Knowledge" Volume 9, Number 2, 2015 131 INTELLECTUAL SEARCH ENGINE OF ADEQUATE INFORMATION IN INTERNET FOR CREATING DATABASES AND KNOWLEDGE BASES Oleksandr

More information

Mubug: a mobile service for rapid bug tracking

Mubug: a mobile service for rapid bug tracking . MOO PAPER. SCIENCE CHINA Information Sciences January 2016, Vol. 59 013101:1 013101:5 doi: 10.1007/s11432-015-5506-4 Mubug: a mobile service for rapid bug tracking Yang FENG, Qin LIU *,MengyuDOU,JiaLIU&ZhenyuCHEN

More information

Research Article An Improved Topology-Potential-Based Community Detection Algorithm for Complex Network

Research Article An Improved Topology-Potential-Based Community Detection Algorithm for Complex Network e Scientific World Journal, Article ID 121609, 7 pages http://dx.doi.org/10.1155/2014/121609 Research Article An Improved Topology-Potential-Based Community Detection Algorithm for Complex Network Zhixiao

More information

Design and Realization of Agricultural Information Intelligent Processing and Application Platform

Design and Realization of Agricultural Information Intelligent Processing and Application Platform Design and Realization of Agricultural Information Intelligent Processing and Application Platform Dan Wang 1,2 1 Institute of Agricultural Information, Chinese Academy of Agricultural Sciences, Beijing

More information

Multisource Remote Sensing Data Mining System Construction in Cloud Computing Environment Dong YinDi 1, Liu ChengJun 1

Multisource Remote Sensing Data Mining System Construction in Cloud Computing Environment Dong YinDi 1, Liu ChengJun 1 4th International Conference on Computer, Mechatronics, Control and Electronic Engineering (ICCMCEE 2015) Multisource Remote Sensing Data Mining System Construction in Cloud Computing Environment Dong

More information

Research on the Application of Notification Service for Service-oriented Digital Library

Research on the Application of Notification Service for Service-oriented Digital Library Research on the Application of Notification Service for Service-oriented Digital Library Zheng Qiaoying, Chen Zhaoneng,Bai Xuesong Shanghai Jiao Tong University Library, Shanghai 200030, China qyzheng@mail.sjtu.edu.cn;

More information

On Finding Power Method in Spreading Activation Search

On Finding Power Method in Spreading Activation Search On Finding Power Method in Spreading Activation Search Ján Suchal Slovak University of Technology Faculty of Informatics and Information Technologies Institute of Informatics and Software Engineering Ilkovičova

More information

A Tagging Approach to Ontology Mapping

A Tagging Approach to Ontology Mapping A Tagging Approach to Ontology Mapping Colm Conroy 1, Declan O'Sullivan 1, Dave Lewis 1 1 Knowledge and Data Engineering Group, Trinity College Dublin {coconroy,declan.osullivan,dave.lewis}@cs.tcd.ie Abstract.

More information

Multi-path based Algorithms for Data Transfer in the Grid Environment

Multi-path based Algorithms for Data Transfer in the Grid Environment New Generation Computing, 28(2010)129-136 Ohmsha, Ltd. and Springer Multi-path based Algorithms for Data Transfer in the Grid Environment Muzhou XIONG 1,2, Dan CHEN 2,3, Hai JIN 1 and Song WU 1 1 School

More information

A Hierarchical Document Clustering Approach with Frequent Itemsets

A Hierarchical Document Clustering Approach with Frequent Itemsets A Hierarchical Document Clustering Approach with Frequent Itemsets Cheng-Jhe Lee, Chiun-Chieh Hsu, and Da-Ren Chen Abstract In order to effectively retrieve required information from the large amount of

More information

Knowledge Engineering in Search Engines

Knowledge Engineering in Search Engines San Jose State University SJSU ScholarWorks Master's Projects Master's Theses and Graduate Research Spring 2012 Knowledge Engineering in Search Engines Yun-Chieh Lin Follow this and additional works at:

More information

Application Research of Wavelet Fusion Algorithm in Electrical Capacitance Tomography

Application Research of Wavelet Fusion Algorithm in Electrical Capacitance Tomography , pp.37-41 http://dx.doi.org/10.14257/astl.2013.31.09 Application Research of Wavelet Fusion Algorithm in Electrical Capacitance Tomography Lanying Li 1, Yun Zhang 1, 1 School of Computer Science and Technology

More information

Domain Specific Search Engine for Students

Domain Specific Search Engine for Students Domain Specific Search Engine for Students Domain Specific Search Engine for Students Wai Yuen Tang The Department of Computer Science City University of Hong Kong, Hong Kong wytang@cs.cityu.edu.hk Lam

More information

Eleven+ Views of Semantic Search

Eleven+ Views of Semantic Search Eleven+ Views of Semantic Search Denise A. D. Bedford, Ph.d. Goodyear Professor of Knowledge Management Information Architecture and Knowledge Management Kent State University Presentation Focus Long-Term

More information

Research on Construction of Road Network Database Based on Video Retrieval Technology

Research on Construction of Road Network Database Based on Video Retrieval Technology Research on Construction of Road Network Database Based on Video Retrieval Technology Fengling Wang 1 1 Hezhou University, School of Mathematics and Computer Hezhou Guangxi 542899, China Abstract. Based

More information

A Survey on Various Techniques of Recommendation System in Web Mining

A Survey on Various Techniques of Recommendation System in Web Mining A Survey on Various Techniques of Recommendation System in Web Mining 1 Yagnesh G. patel, 2 Vishal P.Patel 1 Department of computer engineering 1 S.P.C.E, Visnagar, India Abstract - Today internet has

More information

Usability evaluation of e-commerce on B2C websites in China

Usability evaluation of e-commerce on B2C websites in China Available online at www.sciencedirect.com Procedia Engineering 15 (2011) 5299 5304 Advanced in Control Engineering and Information Science Usability evaluation of e-commerce on B2C websites in China Fangyu

More information

Video annotation based on adaptive annular spatial partition scheme

Video annotation based on adaptive annular spatial partition scheme Video annotation based on adaptive annular spatial partition scheme Guiguang Ding a), Lu Zhang, and Xiaoxu Li Key Laboratory for Information System Security, Ministry of Education, Tsinghua National Laboratory

More information

A Balancing Algorithm in Wireless Sensor Network Based on the Assistance of Approaching Nodes

A Balancing Algorithm in Wireless Sensor Network Based on the Assistance of Approaching Nodes Sensors & Transducers 2013 by IFSA http://www.sensorsportal.com A Balancing Algorithm in Wireless Sensor Network Based on the Assistance of Approaching Nodes 1,* Chengpei Tang, 1 Jiao Yin, 1 Yu Dong 1

More information

Patent Classification Using Ontology-Based Patent Network Analysis

Patent Classification Using Ontology-Based Patent Network Analysis Association for Information Systems AIS Electronic Library (AISeL) PACIS 2010 Proceedings Pacific Asia Conference on Information Systems (PACIS) 2010 Patent Classification Using Ontology-Based Patent Network

More information

Mining Temporal Association Rules in Network Traffic Data

Mining Temporal Association Rules in Network Traffic Data Mining Temporal Association Rules in Network Traffic Data Guojun Mao Abstract Mining association rules is one of the most important and popular task in data mining. Current researches focus on discovering

More information

Two-layer Distance Scheme in Matching Engine for Query by Humming System

Two-layer Distance Scheme in Matching Engine for Query by Humming System Two-layer Distance Scheme in Matching Engine for Query by Humming System Feng Zhang, Yan Song, Lirong Dai, Renhua Wang University of Science and Technology of China, iflytek Speech Lab, Hefei zhangf@ustc.edu,

More information

Assisting Trustworthiness Based Web Services Selection Using the Fidelity of Websites *

Assisting Trustworthiness Based Web Services Selection Using the Fidelity of Websites * Assisting Trustworthiness Based Web Services Selection Using the Fidelity of Websites * Lijie Wang, Fei Liu, Ge Li **, Liang Gu, Liangjie Zhang, and Bing Xie Software Institute, School of Electronic Engineering

More information

Comparative analyses for the performance of Rational Rose and Visio in software engineering teaching

Comparative analyses for the performance of Rational Rose and Visio in software engineering teaching Journal of Physics: Conference Series PAPER OPEN ACCESS Comparative analyses for the performance of Rational Rose and Visio in software engineering teaching To cite this article: Zhaojun Yu and Zhan Xiong

More information

(Refer Slide Time: 1:27)

(Refer Slide Time: 1:27) Data Structures and Algorithms Dr. Naveen Garg Department of Computer Science and Engineering Indian Institute of Technology, Delhi Lecture 1 Introduction to Data Structures and Algorithms Welcome to data

More information

Keywords Data alignment, Data annotation, Web database, Search Result Record

Keywords Data alignment, Data annotation, Web database, Search Result Record Volume 5, Issue 8, August 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Annotating Web

More information

RiMOM Results for OAEI 2009

RiMOM Results for OAEI 2009 RiMOM Results for OAEI 2009 Xiao Zhang, Qian Zhong, Feng Shi, Juanzi Li and Jie Tang Department of Computer Science and Technology, Tsinghua University, Beijing, China zhangxiao,zhongqian,shifeng,ljz,tangjie@keg.cs.tsinghua.edu.cn

More information

Research on Parallelized Stream Data Micro Clustering Algorithm Ke Ma 1, Lingjuan Li 1, Yimu Ji 1, Shengmei Luo 1, Tao Wen 2

Research on Parallelized Stream Data Micro Clustering Algorithm Ke Ma 1, Lingjuan Li 1, Yimu Ji 1, Shengmei Luo 1, Tao Wen 2 International Conference on Advances in Mechanical Engineering and Industrial Informatics (AMEII 2015) Research on Parallelized Stream Data Micro Clustering Algorithm Ke Ma 1, Lingjuan Li 1, Yimu Ji 1,

More information

Design and Implementation of Agricultural Information Resources Vertical Search Engine Based on Nutch

Design and Implementation of Agricultural Information Resources Vertical Search Engine Based on Nutch 619 A publication of CHEMICAL ENGINEERING TRANSACTIONS VOL. 51, 2016 Guest Editors: Tichun Wang, Hongyang Zhang, Lei Tian Copyright 2016, AIDIC Servizi S.r.l., ISBN 978-88-95608-43-3; ISSN 2283-9216 The

More information

Enhancing E-Journal Access In A Digital Work Environment

Enhancing E-Journal Access In A Digital Work Environment Enhancing e-journal access in a digital work environment Foo, S. (2006). Singapore Journal of Library & Information Management, 34, 31-40. Enhancing E-Journal Access In A Digital Work Environment Schubert

More information

INTERNATIONAL JOURNAL OF COMPUTER ENGINEERING & TECHNOLOGY (IJCET)

INTERNATIONAL JOURNAL OF COMPUTER ENGINEERING & TECHNOLOGY (IJCET) INTERNATIONAL JOURNAL OF COMPUTER ENGINEERING & TECHNOLOGY (IJCET) International Journal of Computer Engineering and Technology (IJCET), ISSN 0976-6367(Print), ISSN 0976 6367(Print) ISSN 0976 6375(Online)

More information

Extraction of Context Information from Web Content Using Entity Linking

Extraction of Context Information from Web Content Using Entity Linking 18 IJCSNS International Journal of Computer Science and Network Security, VOL.13 No.2, February 2013 Extraction of Context Information from Web Content Using Entity Linking Norifumi Hirata, Shun Shiramatsu,

More information

Master & Doctor of Philosophy Programs in Computer Science

Master & Doctor of Philosophy Programs in Computer Science Master & Doctor of Philosophy Programs in Computer Science Research Fields Pattern Recognition Data Analysis Internet of Things and Network Communication Machine Learning Web Semantic and Ontology For

More information

If most of the people use Google by writing a few words in the Google windows and perform their search it should be note:

If most of the people use Google by writing a few words in the Google windows and perform their search it should be note: The «Google World» Henri Dou, Competitive Intelligence Think Tank douhenri@yahoo.fr In chapter 1 we presented the key role of information in competitive intelligence and also the necessity to go through

More information

A Complex Network Structure Design for Load Balancing and Redundant

A Complex Network Structure Design for Load Balancing and Redundant Association for Information Systems AIS Electronic Library (AISeL) PACIS 2005 Proceedings Pacific Asia Conference on Information Systems (PACIS) December 2005 A Complex Network Structure Design for Load

More information

WEINER FILTER AND SUB-BLOCK DECOMPOSITION BASED IMAGE RESTORATION FOR MEDICAL APPLICATIONS

WEINER FILTER AND SUB-BLOCK DECOMPOSITION BASED IMAGE RESTORATION FOR MEDICAL APPLICATIONS WEINER FILTER AND SUB-BLOCK DECOMPOSITION BASED IMAGE RESTORATION FOR MEDICAL APPLICATIONS ARIFA SULTANA 1 & KANDARPA KUMAR SARMA 2 1,2 Department of Electronics and Communication Engineering, Gauhati

More information

Proposing a New Metric for Collaborative Filtering

Proposing a New Metric for Collaborative Filtering Journal of Software Engineering and Applications 2011 4 411-416 doi:10.4236/jsea.2011.47047 Published Online July 2011 (http://www.scip.org/journal/jsea) 411 Proposing a New Metric for Collaborative Filtering

More information

FUZZY METRIC SPACES ZUN-QUAN XIA AND FANG-FANG GUO

FUZZY METRIC SPACES ZUN-QUAN XIA AND FANG-FANG GUO J. Appl. Math. & Computing Vol. 16(2004), No. 1-2, pp. 371-381 FUZZY METRIC SPACES ZUN-QUAN XIA AND FANG-FANG GUO Abstract. In this paper, fuzzy metric spaces are redefined, different from the previous

More information

Discovering Advertisement Links by Using URL Text

Discovering Advertisement Links by Using URL Text 017 3rd International Conference on Computational Systems and Communications (ICCSC 017) Discovering Advertisement Links by Using URL Text Jing-Shan Xu1, a, Peng Chang, b,* and Yong-Zheng Zhang, c 1 School

More information

A Network Intrusion Detection System Architecture Based on Snort and. Computational Intelligence

A Network Intrusion Detection System Architecture Based on Snort and. Computational Intelligence 2nd International Conference on Electronics, Network and Computer Engineering (ICENCE 206) A Network Intrusion Detection System Architecture Based on Snort and Computational Intelligence Tao Liu, a, Da

More information

The Structure and Properties of Clique Graphs of Regular Graphs

The Structure and Properties of Clique Graphs of Regular Graphs The University of Southern Mississippi The Aquila Digital Community Master's Theses 1-014 The Structure and Properties of Clique Graphs of Regular Graphs Jan Burmeister University of Southern Mississippi

More information

Research on Load Balancing in Task Allocation Process in Heterogeneous Hadoop Cluster

Research on Load Balancing in Task Allocation Process in Heterogeneous Hadoop Cluster 2017 2 nd International Conference on Artificial Intelligence and Engineering Applications (AIEA 2017) ISBN: 978-1-60595-485-1 Research on Load Balancing in Task Allocation Process in Heterogeneous Hadoop

More information

A Method of Identifying the P2P File Sharing

A Method of Identifying the P2P File Sharing IJCSNS International Journal of Computer Science and Network Security, VOL.10 No.11, November 2010 111 A Method of Identifying the P2P File Sharing Jian-Bo Chen Department of Information & Telecommunications

More information

A Time-based Recommender System using Implicit Feedback

A Time-based Recommender System using Implicit Feedback A Time-based Recommender System using Implicit Feedback T. Q. Lee Department of Mobile Internet Dongyang Technical College Seoul, Korea Abstract - Recommender systems provide personalized recommendations

More information

Research on Applications of Data Mining in Electronic Commerce. Xiuping YANG 1, a

Research on Applications of Data Mining in Electronic Commerce. Xiuping YANG 1, a International Conference on Education Technology, Management and Humanities Science (ETMHS 2015) Research on Applications of Data Mining in Electronic Commerce Xiuping YANG 1, a 1 Computer Science Department,

More information

Research Article Optimization of Access Threshold for Cognitive Radio Networks with Prioritized Secondary Users

Research Article Optimization of Access Threshold for Cognitive Radio Networks with Prioritized Secondary Users Mobile Information Systems Volume 2016, Article ID 3297938, 8 pages http://dx.doi.org/10.1155/2016/3297938 Research Article Optimization of Access Threshold for Cognitive Radio Networks with Prioritized

More information

Parallel Evaluation of Hopfield Neural Networks

Parallel Evaluation of Hopfield Neural Networks Parallel Evaluation of Hopfield Neural Networks Antoine Eiche, Daniel Chillet, Sebastien Pillement and Olivier Sentieys University of Rennes I / IRISA / INRIA 6 rue de Kerampont, BP 818 2232 LANNION,FRANCE

More information

Tendency Mining in Dynamic Association Rules Based on SVM Classifier

Tendency Mining in Dynamic Association Rules Based on SVM Classifier Send Orders for Reprints to reprints@benthamscienceae The Open Mechanical Engineering Journal, 2014, 8, 303-307 303 Open Access Tendency Mining in Dynamic Association Rules Based on SVM Classifier Zhonglin

More information

Data Hiding on Text Using Big-5 Code

Data Hiding on Text Using Big-5 Code Data Hiding on Text Using Big-5 Code Jun-Chou Chuang 1 and Yu-Chen Hu 2 1 Department of Computer Science and Communication Engineering Providence University 200 Chung-Chi Rd., Shalu, Taichung 43301, Republic

More information

Research on Measuring and Optimization Method of Dynamic Accuracy of CNC Machine Tools

Research on Measuring and Optimization Method of Dynamic Accuracy of CNC Machine Tools Sensors & Transducers 2014 by IFSA Publishing, S. L. http://www.sensorsportal.com Research on Measuring and Optimization Method of Dynamic Accuracy of CNC Machine Tools 1, 2 Zhiming FENG, 2 Guofu YIN,

More information

SK International Journal of Multidisciplinary Research Hub Research Article / Survey Paper / Case Study Published By: SK Publisher

SK International Journal of Multidisciplinary Research Hub Research Article / Survey Paper / Case Study Published By: SK Publisher ISSN: 2394 3122 (Online) Volume 2, Issue 1, January 2015 Research Article / Survey Paper / Case Study Published By: SK Publisher P. Elamathi 1 M.Phil. Full Time Research Scholar Vivekanandha College of

More information

AN IMPROVISED FREQUENT PATTERN TREE BASED ASSOCIATION RULE MINING TECHNIQUE WITH MINING FREQUENT ITEM SETS ALGORITHM AND A MODIFIED HEADER TABLE

AN IMPROVISED FREQUENT PATTERN TREE BASED ASSOCIATION RULE MINING TECHNIQUE WITH MINING FREQUENT ITEM SETS ALGORITHM AND A MODIFIED HEADER TABLE AN IMPROVISED FREQUENT PATTERN TREE BASED ASSOCIATION RULE MINING TECHNIQUE WITH MINING FREQUENT ITEM SETS ALGORITHM AND A MODIFIED HEADER TABLE Vandit Agarwal 1, Mandhani Kushal 2 and Preetham Kumar 3

More information

Increasing Parallelism of Loops with the Loop Distribution Technique

Increasing Parallelism of Loops with the Loop Distribution Technique Increasing Parallelism of Loops with the Loop Distribution Technique Ku-Nien Chang and Chang-Biau Yang Department of pplied Mathematics National Sun Yat-sen University Kaohsiung, Taiwan 804, ROC cbyang@math.nsysu.edu.tw

More information

The Study of Genetic Algorithm-based Task Scheduling for Cloud Computing

The Study of Genetic Algorithm-based Task Scheduling for Cloud Computing The Study of Genetic Algorithm-based Task Scheduling for Cloud Computing Sung Ho Jang, Tae Young Kim, Jae Kwon Kim and Jong Sik Lee School of Information Engineering Inha University #253, YongHyun-Dong,

More information

Hole repair algorithm in hybrid sensor networks

Hole repair algorithm in hybrid sensor networks Advances in Engineering Research (AER), volume 116 International Conference on Communication and Electronic Information Engineering (CEIE 2016) Hole repair algorithm in hybrid sensor networks Jian Liu1,

More information

A PERSONALIZED RECOMMENDER SYSTEM FOR TELECOM PRODUCTS AND SERVICES

A PERSONALIZED RECOMMENDER SYSTEM FOR TELECOM PRODUCTS AND SERVICES A PERSONALIZED RECOMMENDER SYSTEM FOR TELECOM PRODUCTS AND SERVICES Zui Zhang, Kun Liu, William Wang, Tai Zhang and Jie Lu Decision Systems & e-service Intelligence Lab, Centre for Quantum Computation

More information

Lecture 3: Linear Classification

Lecture 3: Linear Classification Lecture 3: Linear Classification Roger Grosse 1 Introduction Last week, we saw an example of a learning task called regression. There, the goal was to predict a scalar-valued target from a set of features.

More information

Open Access Multiple Supports based Method for Efficiently Mining Negative Frequent Itemsets

Open Access Multiple Supports based Method for Efficiently Mining Negative Frequent Itemsets Send Orders for Reprints to reprints@benthamscience.ae 428 The Open Cybernetics & Systemics Journal, 2015, 9, 428-432 Open Access Multiple Supports based Method for Efficiently Mining Negative Frequent

More information

Graduate Student Orientation

Graduate Student Orientation Graduate Student Orientation Department of Computer Science The Volgenau School of Engineering Professor Sanjeev Setia, Chair Fall 2018 http://cs.gmu.edu Presented by: Professor Alex Brodsky Outline CS

More information

The Simulation Study of Spread and Evolution about Network Opinion on Education

The Simulation Study of Spread and Evolution about Network Opinion on Education Asian Social Science; Vol. 10, No. 10; 2014 ISSN 1911-2017 E-ISSN 1911-2025 Published by Canadian Center of Science and Education The Simulation Study of Spread and Evolution about Network Opinion on Education

More information

Trust4All: a Trustworthy Middleware Platform for Component Software

Trust4All: a Trustworthy Middleware Platform for Component Software Proceedings of the 7th WSEAS International Conference on Applied Informatics and Communications, Athens, Greece, August 24-26, 2007 124 Trust4All: a Trustworthy Middleware Platform for Component Software

More information

Building Web Annotation Stickies based on Bidirectional Links

Building Web Annotation Stickies based on Bidirectional Links Building Web Annotation Stickies based on Bidirectional Links Hiroyuki Sano, Taiki Ito, Tadachika Ozono and Toramatsu Shintani Dept. of Computer Science and Engineering Graduate School of Engineering,

More information

Proxy Server Systems Improvement Using Frequent Itemset Pattern-Based Techniques

Proxy Server Systems Improvement Using Frequent Itemset Pattern-Based Techniques Proceedings of the 2nd International Conference on Intelligent Systems and Image Processing 2014 Proxy Systems Improvement Using Frequent Itemset Pattern-Based Techniques Saranyoo Butkote *, Jiratta Phuboon-op,

More information

Iteration vs Recursion in Introduction to Programming Classes: An Empirical Study

Iteration vs Recursion in Introduction to Programming Classes: An Empirical Study BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 16, No 4 Sofia 2016 Print ISSN: 1311-9702; Online ISSN: 1314-4081 DOI: 10.1515/cait-2016-0068 Iteration vs Recursion in Introduction

More information

HAI ZHOU. Evanston, IL Glenview, IL (847) (o) (847) (h)

HAI ZHOU. Evanston, IL Glenview, IL (847) (o) (847) (h) HAI ZHOU Electrical and Computer Engineering Northwestern University 2535 Happy Hollow Rd. Evanston, IL 60208-3118 Glenview, IL 60025 haizhou@ece.nwu.edu www.ece.nwu.edu/~haizhou (847) 491-4155 (o) (847)

More information

Scheme of Big-Data Supported Interactive Evolutionary Computation

Scheme of Big-Data Supported Interactive Evolutionary Computation 2017 2nd International Conference on Information Technology and Management Engineering (ITME 2017) ISBN: 978-1-60595-415-8 Scheme of Big-Data Supported Interactive Evolutionary Computation Guo-sheng HAO

More information

INTELLIGENT SUPERMARKET USING APRIORI

INTELLIGENT SUPERMARKET USING APRIORI INTELLIGENT SUPERMARKET USING APRIORI Kasturi Medhekar 1, Arpita Mishra 2, Needhi Kore 3, Nilesh Dave 4 1,2,3,4Student, 3 rd year Diploma, Computer Engineering Department, Thakur Polytechnic, Mumbai, Maharashtra,

More information