archive-org.com » ORG » I » IJORCS.ORG

Total: 231

Choose link from "Titles, links and description words view":

Or switch to "Titles and links view".
  • Ontology Mapping for Dynamic Multiagent Environment
    Ontology Mapping for Dynamic Multiagent Environment International Journal of Research in Computer Science 2 no 3 2012 51 56 doi 10 7815 ijorcs 23 2012 029 Close Abstract Ontologies are essential for the realization of the Semantic Web which in turn relies on the ability of systems to identify and exploit relationships that exist between and within ontologies As ontologies can be used to represent different domains there is a high need for efficient ontology matching techniques that can allow information to be easily shared between different heterogeneous systems There are various systems were proposed recently for ontology mapping Ontology mapping is a prerequisite for achieving heterogeneous data integration on the Semantic Web The vision of the Semantic Web implies that a large number of ontologies present on the web need to be aligned before one can make use of them At the same time these ontologies can be used as domain specific background knowledge by the ontology mapping systems to increase the mapping precision However these ontologies can differ in representation quality and size that pose different challenges to ontology mapping In this paper we analyzed the various challenges of recently introduced Multi Agent Ontology Mapping Framework DSSim and we have integrated an efficient feature called QoS Web Services Composition with DSSsim ie we have improved this framework with QoS based Service Compositions Mechanism From our experimental results it is established that this developed QoS based Web Services Compositions Mechanism for Multiagent Ontology Mapping Framework minimizing uncertain reasoning and improves matching time which are encouraging results of our proposed work References Cited By N Shadbolt W Hall and T Berners Lee The semantic web revisited IEEE Intell Syst vol 21 no 3 pp 96 101 Jan Feb 2006 doi 10 1109 MIS 2006 62 J Euzenat and P Shvaiko Ontology Matching Heidelberg Germany Springer Verlag 2007 M Nagy M Vargas Vera and E Motta DSSim Managing uncertainty on the semantic web in Proc 2nd Int Workshop Ontology Matching 2007 pp 156 168 M Nagy M Vargas Vera and E Motta Multi agent ontology map ping framework in the aqua question answering system inProc 4th MICAI Advances in Artificial Intelligence 2005 pp 70 79 M Vargas Vera and E Motta Aqua Ontology based question answer ing system in Proc 3rd MICAI 2004 vol 2972 pp 468 477 M Vargas Vera and E Motta An ontology driven similarity algorithm Knowl Media Inst Open Univ Milton Keynes U K Tech Rep KMI TR 151 2004 Zibin Zheng Hao Ma Michael R Lyu and Irwin King QoS Aware Web Service Recommendation Collaborative Filtering IEEE Transactions On Service Computing Vol 4 No 2 April June 2011 doi 10 1109 TSC 2010 52 L J Zhang J Zhang and H Cai Services Computing Springer and Tsinghua Univ 2007 L Zeng B Benatallah A H Ngu M Dumas J Kalagnanam and H Chang Qos Aware Middleware for Web Services Composition IEEE Trans Software Eng vol 30 no 5 pp 311 327 May2004 Z Zheng H Ma

    Original URL path: http://www.ijorcs.org/manuscript/id/29/m-jenifer/ontology-mapping-for-dynamic-multiagent-environment (2016-05-01)
    Open archived version from archive

  • A Randomized Load Balancing Algorithm IN GRID USING MAX MIN PSO Algorithm
    and engineering Grid computing does require special software that is unique to the computing project for which the grid is being used In this paper the proposed algorithm namely dynamic load balancing algorithm is created for job scheduling in Grid computing Particle Swarm Intelligence PSO is the latest evolutionary optimization techniques in Swarm Intelligence It has the better performance of global searching and has been successfully applied to many areas The performance measure used for scheduling is done by Quality of service QoS such as makespan cost and deadline Max PSO and Min PSO algorithm has been partially integrated with PSO and finally load on the resources has been balanced References Cited By Dr K Vivekanandan D Ramyachitra A Study on Scheduling in Grid Environment International Journal on Computer Science and Engineering IJCSE Vol 3 No 2 Feb 2011 D P Spooner S A Jarvis J Cao S Saini and G R Nudd Local Grid Scheduling Techniques using Performance Prediction High Performance Systems Group Department of Computer Science University of Warwick Coventry CV4 7AL UK Bart Jacob Michael Brown Kentaro Fukui Nihar Trivedi Introduction to Grid Computing RedBook December 2005 Wei Neng Chen Jun Zhang An Ant Colony Optimization Approach to a Grid workflow Scheduling Problem With Various QoS Requirements IEEE Transactions on Systems man and cybernetics Part c Applications and Reviews vol 39 no 1 January 2009 doi 10 1109 TSMCC 2008 2001722 Alberto Colorni Marco Dorigo Vittorio Maniezzo Distributed Optimization by Ant Colonies European Conference On Artificial Life Paris France Elsevier Publishing 134 142 http en wikipedia org wiki Ant colony optimization algorithms cite note 0 J Kennedy and R Eberhart Particle swarm optimization In Neural Networks Proceedings IEEEInternational Conference on volume 4 pages 1942 1948 vol 4 1995 K Kousalya and P Balasubramanie Task Severance and Task Parceling Based Ant Algorithm for Grid Scheduling International journal of computational cognition http www ijcc us vol 7 no 4 december 2009 Abraham R Buyya and B Nath Nature s heuristics for scheduling jobs on computational Grid In The 8th IEEE International Conference on Advanced Computing and Communications ADCOM 2000 India 2000 Lei Zhang et al A Task Scheduling Algorithm Based on PSO for Grid Computing International Journal of Computational Intelligence Research ISSN 0973 1873 Vol 4 1 2008 pp 37 43 Lei Zhang Yuehui Chen Bo Yang Task Scheduling Based on PSO Algorithm in Computational Grid 2006 Proceedings of the 6th International Conference on Intelligent Systems Design and Applications vol 2 16 18 Oct 2006 Jinan China doi 10 1109 ISDA 2006 253921 Karl Czajkowski Steven Fitzgerald Ian Foster Carl Kesselman Grid Information Services for Distributed Resource Sharing To appear in Proc 10th IEEE Symp on High Performance Distributed Computing 2001 doi 10 1109 HPDC 2001 945188 D Merkle M Middendorf and H Schmeck Ant colony optimization for resource constrained project scheduling IEEE Trans Evol Comput vol 6 no 4 pp 333 346 Aug 2002 doi 10 1109 TEVC 2002 802450 Pakize Erdogmus Particle swarm optimization performance on special

    Original URL path: http://www.ijorcs.org/manuscript/id/24/c-kalpana/a-randomized-load-balancing-algorithm-in-grid-using-max-min-pso-algorithm (2016-05-01)
    Open archived version from archive

  • Max Min Fair Scheduling Algorithm Using In Grid Scheduling With Load Balancing
    2012 41 49 Web 1 May 2016 Gogulan R A Kavitha and U Karthick Kumar Max Min Fair Scheduling Algorithm Using In Grid Scheduling With Load Balancing International Journal of Research in Computer Science 2 no 3 2012 41 49 doi 10 7815 ijorcs 23 2012 028 Close Abstract This paper shows the importance of fair scheduling in grid environment such that all the tasks get equal amount of time for their execution such that it will not lead to starvation The load balancing of the available resources in the computational grid is another important factor This paper considers uniform load to be given to the resources In order to achieve this load balancing is applied after scheduling the jobs It also considers the Execution Cost and Bandwidth Cost for the algorithms used here because in a grid environment the resources are geographically distributed The implementation of this approach the proposed algorithm reaches optimal solution and minimizes the make span as well as the execution cost and bandwidth cost References Cited By Rajkumar Buyya David Abramson and Jonathan Giddy A Case for Economy Grid Architecture for Service Oriented Grid Computing Foster I Kesselman C 1999 The Grid Blueprint for a New Computing Infrastructure Morgan Kaufmann Publishers USA Wolski R Brevik J Plank J and Bryan T 2003 Grid Resource Allocation and Control Using Computational Economies In Grid Computing Making the Global Infrastructure a Reality Berman F Fox G and Hey T editors Wiley and Sons pp 747 772 2003 doi 10 1002 0470867167 Doulamis N D Doulamis A D Varvarigos E A Varvarigou T A 2007 Fair Scheduling Algorithms in Grids IEEE Transactions on Parallel and Distributed Systems Volume18 Issue 11Page s 1630 1648 K Somasundaram S Radhakrishnan 2009 Task Resource Allocation in Grid using Swift Scheduler International Journal of Computers Communications Control ISSN 1841 9836 E ISSN 1841 9844 Vol IV Miguel L Bote Lorenzo Yannis A Dimitriadis And Eduardo Gomez Sanchez 2004 Grid Characteristics and Uses a Grid Definition Springer Verlag LNCS 2970 pp 291 298 Parvin Asadzadeh Rajkumar Buyya1 Chun Ling Kei Deepa Nayar And Srikumar Venugopal Global Grids and Software Toolkits A Study of Four Grid Middleware Technologies Pal Nilsson1 and Michał Pi Oro Unsplittable max min demand allocation a routing problem Hans Jorgen Bang Torbjorn Ekman And David Gesbert A Channel Predictive Proportional Fair Scheduling Algorithm Daphne Lopez S V Kasmir Raja 2009 A Dynamic Error Based Fair Scheduling Algorithm For A Computational Grid Journal Of Theoretical And Applied Information Technology JATIT Qin Zheng Chen Khong Tham Bharadwaj Veeravalli 2008 Dynamic Load Balancing and Pricing in Grid Computing with Communication Delay Journal in Grid Computing doi 10 1007 s10723 007 9093 5 Stefan Schamberger 2005 A Shape Optimizing Load Distribution Heuristic for Parallel Adaptive fem Computations Springer Verlag Berlin Heidelberg Grosu D Chronopoulos A T 2005 Noncooperative load balancing in distributed systems Journal of Parallel Distrib Comput 65 9 1022 1034 doi 10 1016 j jpdc 2005 05 001 Penmatsa S Chronopoulos A T 2005

    Original URL path: http://www.ijorcs.org/manuscript/id/28/r-gogulan/max-min-fair-scheduling-algorithm-using-in-grid-scheduling-with-load-balancing (2016-05-01)
    Open archived version from archive

  • An analysis of the methods employed for breast cancer diagnosis
    Tissue A Convolution Neural Network Classifier with Spatial Domain and Texture Images IEEE Transactions on Medical Imaging Vol 15 No 5 1996 pp 598 610 doi 10 1109 42 538937 T KIYAN T YILDIRIM Breast Cancer Diagnosis using Statistical Neural Networks Journal of Electrical Electronics Engineering Vol 4 2 2004 pp 1149 1153 Hazlina H Sameem A K NurAishah M T Yip C H 2004 Back Propagation Neural Network for the Prognosis of Breast Cancer Comparison on Different Training Algorithms Proceedings Second International Conference on Artificial Intelligence in Engineering Technology 2004 3rd 4th Aug Sabah pp 445 449 Fadzilah S Azliza M A 2004 Web Based Neurofuzzy Classification for Breast Cancer Proceedings Second International Conference on Artificial Intelligence in Engineering Technology 2004 3rd 4th Aug Sabah pp 383 387 C M CHEN Y H CHOU K C HAN G S HUNG C M TIU H J CHIOU S Y CHIOU Breast Lesions on Sonograms Computer Aided Diagnosis with Nearly Setting Independent features and Artificial Neural Networks Radiology Vol 226 2003 pp 504 514 G SCHWARZER W VACH M SCHUMACHER On the Misuses of Artificial Neural Networks for Prognostic and Diagnostic Classification in Oncology Statistics in Medicine Vol 19 2005 pp 541 561 F E AHMED Artificial Neural Networks for Diagnosis and Survival Prediction in Colon Cancer Molecular Cancer Vol 4 2005 pp 29 H B BURKE D B ROSEN P H GOODMAN Comparing Artificial Neural Networks to other Statistical Methods for Medical outcome Prediction IEEE World Congress Vol 4 1994 pp 2213 2216 doi 10 1109 ICNN 1994 374560 Mojarad S A Dlay S S Woo W L Sherbet G V 2010 Breast Cancer prediction and cross validation using multilayer perceptron neural networks Proceedings 7th Communication Systems Networks and Digital Signal Processing 2010 CSNDSP 2010 21st 23rd July IEEE Newcastle Upon Tyne pp 760 764 H B BURKE P H GOODMAN D B ROSEN D E HENSON J N WEINSTEIN F E HARRELL J J R MARKS D P WINCHESTER D G BOSTWICK Artificial Neural Networks Improve the Accuracy of Cancer Survival Prediction Cancer Vol 79 1997 pp 857 862 doi 10 1002 SICI 1097 0142 19970215 79 4 3 0 CO 2 Y Ashraf M Kim Le Xu Huang 2010 Information Gain and Adaptive Neuro Fuzzy Inference System for Breast Cancer Diagnoses Proceedings Computer Sciences Convergence Information Technology 2010 ICCIT 2010 30th Nov 2nd Dec IEEE Seoul pp 911 915 doi 10 1109 ICCIT 2010 5711189 Vazirani H Kala R Shukla A Tiwari R 2010 Diagnosis of Breast Cancer by Modular Neural Network Proceedings 3rd IEEE International Conference on Computer Science and Information Technology 2010 ICCIST 2010 9th 11th July IEEE Chengdu pp 115 119 doi 10 1109 ICCSIT 2010 5564054 Mishra A K Sardar S 2010 Application Specific Instrumentation and its Feasibility for UWB Sensor Based Breast Cancer Diagnosis Proceedings International Conference on Power Control and Embedded Systems 2010 IPCES 2010 IEEE Allahabad pp 1 4 doi 10 1109 ICPCES 2010 5698671 Jamarani S M H Rezai rad

    Original URL path: http://www.ijorcs.org/manuscript/id/25/mahjabeen-mirza-beg/an-analysis-of-the-methods-employed-for-breast-cancer-diagnosis (2016-05-01)
    Open archived version from archive

  • Analysis of Handoff Techniques used for Hybrid Networks: Cellular / WLAN
    ijorcs 24 2012 039 Close Abstract Most real life networks are hybrid networks A hybrid network combines the best features of two or more networks In networking terminology a hybrid network according to Information Technology control and Audit are reliable and versatile They provide large numbers of connections and data transmission paths to users These hybrid networks may be treated as network nodes for analysis purpose The two radio access technologies RATs are considered with cellular WLAN depending on whether it is voice data video For observing practical result some setups are required in laboratory which includes interface from personal computer to mobile terminal and vice versa The network simulator Ns 2 is used for analysis purpose The results shows the parameters like energy good put Bandwidth utilization packet delivery ratio energy good put and energy consumed are improved after using hybrid networks References Cited By Radio Resource Management in further Wireless Networks Requirement and Limitations By Jens Zander Royal Institute of Technology An Efficient Radio Resource allocation scheme for spatial Multi user Access in MIMO OFDM Systems By Ying Jun Zhang Kaled Ben Lettering IEEE Transactions on communications Vol 53 NO 1 January 2005 doi 10 1109 TCOMM 2004 840666 Resource allocation for multicast services in multicarrier wireless communications by Changho Suh Jeoghoon Mo IEEE Transactions on wireless communication vol 7 NO 1 January 2008 doi 10 1109 TWC 2008 060467 Resource Management for Service Provider in Heterogeneous Wireless Network By Xu Yang John Bigham Laurie Cuthbert Intelligent Radio Resource Management for IEEE 802 11 WLAN By y wang l g cuthbert j bigham An Algorithm For Radio Resource Management in Integrated Cellular WLAN Networks By Ioannis Modeas Alexenderos Kaloxylos Nikos Passas Lazaros Merakos in Annual IEEE International Symposium On Personal Indoor and Mobile Radio Communications PIMRC 07 Resource

    Original URL path: http://www.ijorcs.org/manuscript/id/39/dr-pb-mane/analysis-of-handoff-techniques-used-for-hybrid-networks (2016-05-01)
    Open archived version from archive

  • A Novel Statistical Method for Thermostable Protein Discrimination
    in this study The effect of mentioned features on proposed discrimination algorithm was evaluated both separately and in combination Statistical methods are used in the proposed algorithm The results of implementing the algorithm on a dataset containing 239 mesophilic proteins 69 thermophilic proteins and 59 hyper thermophilic proteins show the effect of each bunch of features on the evaluation measures References Cited By C I Branden J Tooze Introduction to protein structure 2nd edition New York Garland Pub 1999 Todd T Iosif V Discrimination of thermophilic and mesophilic protein Taylor and Vaisman BMC Structural Biology vol 10 2010 doi 10 1186 1472 6807 10 S1 S5 Xingyu W Shouliang C Mingde G General Biology Version 2 Higher Education Press Beijing 2005 Brock T Freeze H Thermus aquaticus gen n and sp n a Nonsporulating Extreme Thermophile J Bactriol vol 98 pp 289 297 1969 Jingru Xu Yuehui Chen Discrimination of Protein Thermostability Based on a New Integrated Neural Network vol 1 pp 107 112 Springer 2011 Kumar S Nussinov R How do thermophilic proteins deal with heat Cell Mol Life Sci vol 58 pp 1216 1233 2001 doi 10 1007 PL00000935 Thompson MJ Eisenberg D Transprotemic evidence of a loop deletion mechanism for enhancing protein thermostability J Mol Biol vol 290 pp 595 604 1999 doi 10 1006 jmbi 1999 2889 Haney PJ Jonathan HB Berald LB Thermal adaption analyzed by comparison of protein sequences from mesophilic and extremely thermophilic Methanococcus species PNAS vol 96 pp 3578 3583 1999 doi 10 1073 pnas 96 7 3578 Vielle C Zeikus GJ Hyperthermophilic enzymes sources uses and molecular mechanisms for thermostability Microbiol Mol Biol Rev vol 65 pp 1 43 2001 Ding YR Cai YJ Zhang GX The influence of dipeptide composition on protein thermostability FEBS Lett vol 569 pp 284 288 2004 doi 10 1016 j febslet 2004 06 009 Kumarevel TS Gromiha MM Ponnuswamy MN Structural class predication an application of residue distribution along the sequence Biophys Chemist vol 88 pp 81 101 2000 doi 10 1016 S0301 4622 00 00201 5 Gromiha MM Shandar A Makiko S Application of residue distribution along the sequence for discriminating outer membrane proteins Comput Biol Chem vol 29 pp 135 142 2005 doi 10 1016 j compbiolchem 2005 02 006 Seung P Young J Protein Thermostability Structure Based Difference of Amino acid between Thermophilic and Mesophilic Proteins Elsevier Journal of Biotech vol 111 pp 269 277 2004 Michael G Xavier S Discrimination and Classification of Mesophilic and Thermophilic Protein using Machine Learning Algorithms Willy InterSience pp 1274 1279 2007 http www pdb org Available at June 24 2012 Zahng G Fang B Study on the Discrimination of Thermophilic and Mesophilic Proteins Based on Dipeptide Composition Chinese journal of biotechnology vol 22 pp 293 298 2006 Eshkin A Ghafuri H Predication of relative solvent accessibility by support vector regression and best first method Excli Journal vol 9 pp 29 38 2010 Platzer A Percpo P Characterization of protein interaction networks in tumors BMC Bioinformatics

    Original URL path: http://www.ijorcs.org/manuscript/id/32/elham-nikookar/a-novel-statistical-method-for-thermostable-protein-discrimination (2016-05-01)
    Open archived version from archive

  • BIGP- A New Single Protocol that can work as an IGP (Interior Gateway Protocol) as well as EGP (Exterior Gateway Protocol)
    4 2012 13 17 doi 10 7815 ijorcs 24 2012 034 Close Abstract EGP and IGP are the key components of the present internet infrastructure Routers in a domain forward IP packet within and between domains Each domain uses an intra domain routing protocol known as Interior Gateway Protocol IGP like IS IS OSPF RIP etc to populate the routing tables of its routers Routing information must also be exchanged between domains to ensure that a host in one domain can reach another host in remote domain This role is performed by inter domain routing protocol called Exterior Gateway Protocol EGP Basically EGP used these days is Border Gateway Protocol BGP Basic difference between the both is that BGP has smaller convergence as compared to the IGP s And IGP s on the other hand have lesser scalability as compared to the BGP So in this paper a proposal to create a new protocol is given which can act as an IGP when we consider inter domain transfer of traffic and acts as BGP when we consider intra domain transfer of traffic References Cited By Border Gateway Protocol Internetworking technology overview June 1999 XU Ke Wang An ping WU Jian ping and WANG Bin Research on Routing Policy and Routing Information Propagation of Boarder Gateway Protocol Version 4 BGP 4 Proceedings of IEEE TENCON 02 Selin Cerav Erbas Olivier Delcourt Bernard Fortz and Bruno Quoitin The Interaction of IGP Weight Optimization with BGP IEEE conference 2007 Martin O Nicholes and Biswanath Mukherjee A Survey of Security Techniques for the Border Gateway Protocol BGP IEEE communications surveys tutorials vol 11 no 1 first quarter 2009 doi 10 1109 SURV 2009 090105 Masafumi Watari Yuichiro Hei Shigehiro Ano and Katsuyuki Yamazaki OSPF based Fast Reroute for BGP Link Failures IEEE GLOBECOM 2009 proceedings doi 10 1109 GLOCOM 2009 5425488 Jesús Expósito Valentina Trujillo and Eric Gamess Easy EIGRP A Didactic Application for Teaching and Learning of the Enhanced Interior Gateway Routing Protocol 2010 Sixth International Conference on Networking and Services doi 10 1109 ICNS 2010 53 Dahai Xu Optimal traffic engineering via newton s method 2008 IEEE conference doi 10 1109 ICNS 2010 53 Conor Creagh and Cormac Sreenan An Interior Path Vector Routing Protocol 2006 IEEE doi 10 1109 LCN 2006 322096 Hongjun Wang Wanping Hao and Xin Zhao A Method to Eliminate BGP Divergence Based on AS Relationships 2010 Second Pacific Asia Conference on Circuits Communications and System PACCS doi 10 1109 PACCS 2010 5627907 Steve Uhlig and Bruno Quoitin Tweak it BGP based Interdomain Traffic Engineering for transit Ass 2005 IEEE doi 10 1109 NGI 2005 1431650 Anja Feldmann Lixin Gao and Timothy Griffin Z Morley Mao Inter domain Routing and the Border Gateway Protocol IEEE Network November December 2005 Sharad Agarwal Antonio Nucci and Supratik Bhattacharyya Measuring the Shared Fate of IGP Engineering and Interdomain Traffic Proceedings of the 13th IEEE International Conference on Network Protocols ICNP 05 Hongwei Zhang Anish Arora and Zhijun Liu A Stability oriented

    Original URL path: http://www.ijorcs.org/manuscript/id/34/isha-gupta/bigp-a-new-single-protocol-that-can-work-as-an-igp-interior-gateway-protocol-as-well-as-egp-exterior-gateway-protocol (2016-05-01)
    Open archived version from archive

  • Privacy Preserving MFI Based Similarity Measure for Hierarchical Document Clustering
    in response to a simple query In this paper first we proposed a novel approach to precisely define clusters based on maximal frequent item set MFI by Apriori algorithm Afterwards utilizing the same maximal frequent item set MFI based similarity measure for Hierarchical document clustering By considering maximal frequent item sets the dimensionality of document set is decreased Secondly providing privacy preserving of open web documents is to avoiding duplicate documents There by we can protect the privacy of individual copy rights of documents This can be achieved using equivalence relation References Cited By Ruxixu Donald Wunsch A Survey of Clustering Algorithms In the Proceedings of IEEE Transactions on Neural Networks Vol 16 No 3 May 2005 Jain A K Murty M N Flynn P J Data Clustering A Review In the Proceedings of ACM Computing Surveys Vol 31 No 3 1999 pp 264 323 doi 10 1145 331499 331504 Kleinberg J M Authoritative Sources in a Hyperlinked Environment In the Journal of the ACM Vol 46 No 5 1999 pp 604 632 doi 10 1145 324133 324140 Ling Zhuang Honghua Dai 2004 A Maximal Frequent Item Set Approach for Web Document Clustering In Proceedings of the IEEE Fourth International Conference on Computer and Information Technology 2004 CIT 2004 doi 10 1109 CIT 2004 1357322 Michael W Trosset 2008 Representing Clusters k Means Clustering Self Organizing Maps and Multidimensional Scaling Technical Report Department of Statistics Indian University Bloomington 2008 Michael Steinbach George karypis and Vipinkumar 2000 A Comparison of Document Clustering Techniques In Proceedings of the Workshop on Text Mining 2000 KDD 2000 Boston pp 109 111 Beil F Ester M Xu X 2002 Frequent Term Based Text Clustering In Proceedings of 8th International Conference on Knowledge Discovery and Data mining 2002 KDD 2002 Edmonton Alberta Canada BenjaminFung C M Wang Ke Ester Martin 2003 Hierarchical Document Clustering using Frequent Item Sets In Proceedings SIAM International Conference on Data Mining 2003 SIAM DM 2003 pp 59 70 Agrawal R Srikant R 1994 Fast Algorithms for Mining Association Rules In the Proceedings of 20th International Conference on Very Large Data Bases 1994 Santiago Chile PP 487 499 Liu W L and Zeng X S 2005 Document Clustering Based on Frequent Term Sets Proceedings of Intelligent Systems and Control 2005 Zamir O Etzioni O 1998 Web Document Clustering A Feasibility Demonstration In the Proceedings of ACM 1998 SIGIR 98 PP 46 54 Kjersti 1997 A Survey on Personalized Information Filtering Systems for the World Wide Web Technical Report 922 Norwegian Computing Center 1997 Prasannakumar J Govindarajulu P Duplicate and Near Duplicate Documents Detection A Review European Journal of Scientific Research ISSN 1450 216X Vol 32 No 4 2009 pp 514 527 Syed Mudhasir Y Deepika J Near Duplicate Detection and Elimination Based on Web Provenance for Efficient Web Search In the Proceedings of International Journal on Internet and Distributed Computing Systems Vol 1 No 1 2011 Alsulami B S Abulkhair F Essa E Near Duplicate Document Detection Survey In the Proceedings of

    Original URL path: http://www.ijorcs.org/manuscript/id/33/p-rajesh/privacy-preserving-mfi-based-similarity-measure-for-hierarchical-document-clustering (2016-05-01)
    Open archived version from archive



  •