A Fast Global k-means Algorithm for Datasets having Streaming Behavior
Research Paper | Journal Paper
Vol.6 , Issue.2 , pp.84-91, Feb-2018
CrossRef-DOI: https://doi.org/10.26438/ijcse/v6i2.8491
Abstract
The k-means algorithm and its variations are known to be fast clustering algorithms. However, they are sensitive to the choice of starting points and are inefficient for solving clustering problems in large datasets. Recently, incremental approaches have been developed to resolve difficulties with the choice of starting points. The global k-means and the fast global k-means algorithms are based on such an approach. They iteratively add one cluster center at a time. Numerical experiments show that these algorithms considerably improve the k-means algorithm. However, they require storing the whole affinity matrix or computing this matrix at each iteration. This makes both algorithms time consuming and memory demanding for clustering even moderately large datasets. Also the continuously arriving data stream has become common phenomenon for many fields recent years; for example, sensor networks, web click stream and internet traffic flow. Researchers proposes many innovative technologies to manage such streaming datasets. Finding efficient data stream mining algorithm has become an important research subject. In this paper we propose a fast global k-means algorithm for datasets having streaming behavior. Experiment shows that our proposed algorithm is more efficient than the fast global k-means algorithm in case of streaming datasets
Key-Words / Index Term
k-Means, Global k-Means, Fast Global k-Means, Data Streaming
References
[1] Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom, “Models and issues in data stream systems,” in Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, ser. PODS ’02, 2002, pp. 1–16.
[2] L. Bai, J. Liang, C. Sui, and C. Dang, “Fast global k-means clustering based on local geometrical information,” Information Sciences, vol. 245, no. 0, pp. 168 – 180, 2013.
[3] I. Fodor. (2002) A Survey of Dimen sion Reduction Techniques. [Online]. Available: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.5098
[4] S. T. Roweis and L. K. Saul, “Nonlinear dimensionality reduction by locally linear embedding,” SCIENCE, vol. 290, pp. 2323–2326, 2000.
[5] J. B. Tenenbaum, V. d. Silva, and J. C. Langford, “A global geometric framework for nonlinear dimensionality reduction,” Science, vol. 290, no. 5500, pp. 2319–2323, 2000.
[6] H.-P. Kriegel, P. Kro¨ger, and A. Zimek, “Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering,” ACM Trans. Knowl. Discov. Data, vol. 3, no. 1, pp. 1:1–1:58, Mar. 2009.
[7] A. Jain and R. Dubes, Eds., Algorithms for Clustering Data. Prentice Hall, 1988.
[8] A. Likas, M. Vlassis, and J. Verbeek, “The global k-means clustering algorithm,” Pattern Recognition, vol. 35, no. 2, pp. 451–461, 2003.
[9] A. Bagirov, “Modified global k-means algorithm for sum-of-squares clustering problem,” Pattern Recognition, vol. 41, pp. 3192–3199, 2008.
[10] L. O’Callaghan, N. Mishra, A. Meyerson, S. Guha, and R. Motwani, “Streaming-data algorithms for high-quality clustering,” in Data Engi- neering, 2002. Proceedings. 18th International Conference on, 2002, pp. 685–694.
[11] P. Domingos and G. Hulten, “A general method for scaling up machine learning algorithms and its application to clustering,” in Proceedings of the Eighteenth International Conference on Machine Learning, ser. ICML ’01, 2001, pp. 106–113.
[12] C. C. Aggarwal, J. Han, J. Wang, and P. S. Yu, “A framework for clus tering evolving data streams,” in Proceedings of the 29th international conference on Very large data bases - Volume 29, ser. VLDB ’03, 2003, pp. 81-92
[13] R. Wan, X. Yan, and X. Su, “A weighted fuzzy clustering algorithm for data stream,” in Proceedings of the 2008 ISECS International Colloquium on Computing, Communication, Control, and Management- Volume 01, ser. CCCM ’08, 2008, pp. 360–364.
[14] L. Bai, J. Liang, C. Sui, and C. Dang, “Fast global k-means clustering based on local geometrical information,” Information Sciences, vol. 245, no. 0, pp. 168 – 180, 2013.
[15] J. Xie and S. Jiang, “A simple and fast algorithm for global k-means clustering,” in Education Technology and Computer Science (ETCS), 2010 Second International Workshop on, vol. 2, March 2010, pp. 36– 40.
[16] L.-E. Sal, J. Carrasco-Ochoa, and M.-T. Fco, “Fast global k-means with similarity functions algorithm,” in Intelligent Data Engineering and Automated Learning IDEAL 2006, ser. Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2006, vol. 4224, pp. 512–521.
Citation
Purnendu Das, Bishwa Ranjan Roy, Sanju Das, "A Fast Global k-means Algorithm for Datasets having Streaming Behavior," International Journal of Computer Sciences and Engineering, Vol.6, Issue.2, pp.84-91, 2018.
DFID Time Complexity in Mobile Network
Research Paper | Journal Paper
Vol.6 , Issue.2 , pp.92-97, Feb-2018
CrossRef-DOI: https://doi.org/10.26438/ijcse/v6i2.9297
Abstract
Hexagonal network structures the base for mobile communication networks. To increase the efficiency of mobile communication, we implement the DFID algorithm for transmission. Let DFID denote the time taken by DFS and BFS preorder traversing to find the vertex x in graph DFID(x,G). In this section we discuss DFS and BFS for G beign a hexagonal mesh of dimension n i.e HXn..Thereby computing the time complexity of DFID algorithm for mobile networking.
Key-Words / Index Term
DFID, BFS, DFS, Hexagonal mesh, Time complexity
References
[1] T . H . Cormen, C. E . Leiserson, R. L. Rivest and C. Stein “Introduction to Algorithms” , Cambridge, MA: MIT Press , September 2009
[2] N. Gelfand , M . T. Goodrich and R. Tammasia,”teaching Da t a Structure Design Patterns,” Proceedings of the 29 SIGCSE Technical Symposium on Computer Science Education, vol. 30 (pp. 331-335) , Providence, RI, USA, 1998 .
[3] R.Bayer, “Binary B-Trees for Virtual Memory ,” Proceedings of ACM SIGFIDET Workshop on Data Description, Access and Control , pp. 219-235, San Diego , CA, USA, 1971
[4] R. Tarjan, “Depth First Search and Linear Graph Algorithms,” Proceedings of the 12th Annual IEEE Symposium on Switching and Automata Theory, pp. 141-121, East Lansing, MI, USA, 1971.
[5] Everitt, Tom, and Marcus Hutter. "Analytical Results on the BFS vs. DFS Algorithm Selection Problem. Part I: Tree Search." Australasian Joint Conference on Artificial Intelligence. Springer International Publishing, 2015
[6] Everitt, Tom, and Marcus Hutter. "Analytical Results on the BFS vs. DFS Algorithm Selection Problem: Part II: Graph Search." Australasian Joint Conference on Artificial Intelligence. Springer International Publishing, 2015.
[7] J.A.Bondy, U.S.R. Murty, Graph Theory with Applications, North Holland, New York.Amsterdam.Oxford, 1976.
[8] F. Harray. Graph Thoery. Addison. Wesley, Reading. Mass (1969).
[9] Deo, Narsingh. Graph theory with applications to engineering and computer science. Courier Dover Publications, 2016.
[10] A.Bagchi, S.Hakimi, Data Transfers in Broadcast Networks, IEEE TransactionsComput. 41, (1992).
[11] R.Balakrishnan, K.Ranganathan, A Text Book of Graph Theory, Springer,(1999)
[12] C.Berge, The Theory of Graphs, Methuen, (1962).
[13] N.L.Biggs, E.K.Loyd, R.J.Wilson, Graph Theory, Oxford UniversityPress,(1976), 1736 { 1936 .R.Diestel, Graph Theory, Springer, (1991).
[14] J.L.Gross, J.Yellen, Graph Theory and its Applications, CRC Press, (1998).
Citation
Justin Sophia. I, N. Rama, "DFID Time Complexity in Mobile Network," International Journal of Computer Sciences and Engineering, Vol.6, Issue.2, pp.92-97, 2018.
Event Extraction from Twitter using Scoring Function and LDA
Research Paper | Journal Paper
Vol.6 , Issue.2 , pp.98-103, Feb-2018
CrossRef-DOI: https://doi.org/10.26438/ijcse/v6i2.98103
Abstract
Extracting and interpreting information from user generated content is a current topic in the scientific community and in the business world. Furthermore, data with a spatial component are even more important. This is proved by the numerous web applications that deal with processing and visualization of user generated content. The task of this extraction is to collect major life events in the form of retrievable entries that include structured data about major life event name, location and time which are often, categorized by complex, and nested structures involving ambiguous entities.
Key-Words / Index Term
Events, tweets, LDA, Extraction
References
[1]. Mohammad AL-smadi and Omar Qawasmeh “Knowledge-based approach for Event extraction from Arabic tweets”,IJACSA,vol.7,No. 6, 2016.
[2]. John foley, Michael Benderky and Vanja Josifovski, “Learning to extract local events from the web”SIGIR, ACM 978-1-4503-3621-5/15/08, 2015.
[3]. Jiwei Li, Alan Ritter, Claire Cardie and Eduard Hovy. “Major life event extraction from twitter based on congratulations/condolences speech Acts”,ICWSM, 11:438–4412015.
[4]. G. Katsios, S. Vakulenko , A. Krithara and G. Paliouras, “open domain event extraction from twitter”, ACM 978-1-4503-1462-6 /12/08,2012.
[5]. Feifan Liu, Jinying Chen, Abhyuday Jagannathha, Hong Yu., “learning from Biomedical Information Extraction: Methodology Review of Recent Advances”,DOI: http://dx.doi.org/10.1101/034397, 2016.
[6]. Abdur Rahman M.A. Basher, Alexander S. Purdy and Inanc Birol. “Event Extraction from Biomedical Literature”,,Journal of Bioinformatics and Computational Biology,Vol. 8, No. 1 ,131–146, 2015.
[7]. Frederik Hogenboom, Flavius Frasincar, Uzay Kaymak, Franciska de Jong and Emiel caron, “ survey of Event Extraction methods from text for decision support system”, Decision Support Systems 55(1)256-269,2016.
[8]. Dr. D Ramesh, Dr.S.Suresh kumar. “Event Extraction from Natural language Text”,In IJESRT in 2016.
[9]. Kolikipogu Ramakrishna, Vanitha Guda, Dr.B.Padmaja Rani , Vinaya Ch, “novel model for timed event extraction and temporal reasoning in legal text documents” , In Proceedings of the Fifteenth Conference on Computational Natural Language Learning, pages 49-57,2011.
[10]. H. Aliane, W. Guendouzi, and A. Mokrani, “Annotating events,time and place expressions in arabic texts.” in RANLP, 2013, pp. 25–31.
[11]. J. M. Pawlowski, M. Bick, R. Peinl, S. Thalmann, R. Maier,D.-W.-I. L. Hetmank, D.-W.-I. P. Kruse, M. Martensen, and H. Pirkkalainen, “Social knowledge environments,” Business & Information Systems Engineering, vol. 6, no. 2, pp. 81–88, 2014.
[12]. J. Lehmann, R. Isele, M. Jakob, A. Jentzsch, D. Kontokostas, P. N. Mendes, S. Hellmann, M. Morsey, P. van Kleef, S. Auer et al., “Dbpedia–a large-scale, multilingual knowledge base extracted from wikipedia,” Semantic Web, vol. 6, no. 2, pp. 167–195, 2015.
[13]. W. Thamviset and S. Wongthanavasu. Bottom-up region extractor for semi-structured web pages. In ICSEC`14, pages 284{289. IEEE, 2014}.
[14]. E. Kuzey, J. Vreeken, and G. Weikum. A fresh look on
[15]. knowledge bases: Distilling named events from news. In CIKM`14, pages 1689{1698. ACM, 2014}.
[16]. R. Manjula and A. Chilambuchelvan. Extracting templates from web pages. In Green Computing, Communication and Conservation of Energy (ICGCE), 2013 International Conference on, pages 788{791. IEEE, 2013}.
[17]. Hristo Tanev, Maud Ehrmann, Jakub Piskorski and Vanni Zavarella, “Enhancing Event Descriptions through Twitter Mining”, Sixth International AAAI Conference on Weblogs and Social Media,pages.
[18]. Jakub Piskorski and Roman Yangarbe, “Information extraction: past ,future ,present”, DOI 10.1007/978-3-642-28569-1__2,© Springer-Verlag Berlin Heidelberg, in 2013.
Citation
Monika Gupta, Parul Gupta, "Event Extraction from Twitter using Scoring Function and LDA," International Journal of Computer Sciences and Engineering, Vol.6, Issue.2, pp.98-103, 2018.
Driver Behavior Monitoring and Alerting System Using Samrt Phone
Research Paper | Journal Paper
Vol.6 , Issue.2 , pp.104-111, Feb-2018
CrossRef-DOI: https://doi.org/10.26438/ijcse/v6i2.104111
Abstract
Objective of this research work is to build a driver monitoring system. Nowadays because of the road accidents death rate is keep on increasing and the vehicle production rate is also increasing which leads to pollution. Driver Alert application is developed to alert the drivers for dangerous driving events with respect to driver behavior and road conditions. This system focuses on the most commonly occurring dangerous driving events: drowsy driving, inattentive driving, lane weaving and drifting, and vehicle detection. Driver behavior is monitored with his head pose and eye state using front camera of the mobile. Similarly, in the rear camera the dangerous driving conditions at the road are detected with respect to lane conditions and vehicles (living being, non-living being) on the road. If the system detects any dangerous events on any of the camera, then it alerts the driver by displaying an alert icon on the mobile’s touch screen along with an audible alert message. To process the video frames from both front and rear camera a context-switching algorithm is used. So that the driver will be notices in both the way and alerted for them. An Emergency system is developed to tell about the driver problem to the outside people for dangerous events like accident, heart attack or any health issue which makes him distracted while driving
Key-Words / Index Term
Head pose, lane detection, context switching, emergency system, driver alert
References
[1] E. Aidman, C. Chadunow, K. Johnson, & J. Reece, “Real-time driver drowsiness feedback improves driver alertness and self-reported driving performance”, Accident Analysis and Prevention, 81, 8–13, 2015.
[2] M. Montes-de-oca, T. J. Bao, N. D. Lane, G. Cardone, L. Torresani, A. T. Campbell, “CarSafe : A Driver Safety App that Detects Dangerous Driving Behavior using Dual-Cameras on Smartphones”, MobiSys’13, 5–6, 2013.
[3] I. Road, E Union & D.A. Systems, “Hybrid computer vision system for drivers eye recognition and fatigue monitoring” ,Accident Analysis and Prevention , 126, 78–94, 2014.
[4] R.O. Mbouna, S.G. Kong, M. Chun, “Visual Analysis of Eye State and Head Pose for Driver Alertness Monitoring”, IEEE transactions on intelligent transportation systems, 14(3), 1462–1469, 2013.
[5] A. Bener, E. Yildirim & T. Lajunen, “Driver sleepiness , fatigue , careless behavior and risk of motor vehicle crash and injury : Population based case and control study”, journal of traffic and transport engineering, 4 (5) : 4 9 6 - 5 0 2, 2017.
[6] G. Boboc, A.I. Dumitru, T. Girbacia, C. Postelnicu, & G. Mogan, “Effects of smartphone based advanced driver assistance system on distracted driving behavior : A simulator study” Computers in Human Behavior, 83, 1–7, 2018.
[7] C. Zhang, H. Wang, R. Fu, “ Automated Detection of Driver Fatigue Based on Entropy and Complexity Measures”, IEEE transactions on intelligent transportation systems, vol. 15, no. 1, 2014.
[8] W. Cheng, H. Liao, M. Pan, & C. Chen, “A Fatigue Detection System with Eyeglasses Removal”, ICACT, 331–335, 2013.
[9] K. Dwivedi, K. Biswaranjan, A. Sethi, “Drowsy Driver Detection using Representation Learning”, IEEE Conference, 995–999, 2014.
[10] G. Divekar, A.K. Pradhan, K.M. Masserang, I. Reagan, A. Pollatsek, D. Fisher, “A simulator evaluation of the effects of attention maintenance training on glance distributions of younger novice drivers inside and outside the vehicle”, Transportation Research Part F: Psychology and Behaviour, 20, 154–169, 2013.
[11] T.W. Planek, J. Thomas, K. Schmidt, M. Beggiato, K. Heinz, J. F. Krems, “ Letter from the Editors A mathematical model for predicting lane changes using the steering wheel angle”, Journal of Safety Research, 85.e1-90, 2014.
[12] C. Wang, B. David, R. Chalon, C. Yin, “Dynamic road lane management study q A Smart City application”, Transportation Research Part E, 2015.
[13] J. Son, H. Yoo, S. Kim, K. Sohn,” Real-time illumination invariant lane detection for lane departure warning system”, Expert Systems With Applications, 42(4), 1816–1824, 2015.
[14] S. Yi, Y. Chen, C. Chang, “ A lane detection approach based on intelligent vision”, Computers and Electrical Engineering, 42(2), 23–29, 2015.
[15] R. K. Satzoda, P. Gunaratne, M. Trivedi, “Drive Analysis using Lane Semantics for Data Reduction in Naturalistic Driving Studies”, IEEE Intelligent Vehicles Symposium (IV) , 1–6, 2014.
[16] Z. Sun, G. Bebis, R. Miller, “On-Road Vehicle Detection : A Review”, IEEE transactions on pattern analysis and machine intelligence, vol. 28, no. 5, 2006.
[17] M. Fazeen, B. Gozick, R. Dantu, M. Bhukhiya, M.C. González, “Short Papers Safe Driving Using Mobile Phones”, IEEE transactions on intelligent transportation systems, VOL. 13, NO. 3, 2012.
[18] A. Galletta, L. Carnevale, M. Fazio, A. Lay-ekuakille, M. Villari, “An IoT Cloud System for Traffic Monitoring and Vehicular”, Accidents Prevention Based on Mobile Sensor Data Processing, 1748(c), 2017.
[19] F. Mohammad, K. Mahadas, G. H. Hung, “ Drowsy driver mobile application : Development of a novel scleral-area detection method” Computers in Biology and Medicine, 76–83, 2017.
[20] V. R. Tannahill, K. M. Muttaqi, D. Sutanto, “Driver alerting system using range estimation of electric vehicles in real time under dynamically varying environmental conditions”, IET Electrical Systems in Transportation, 107–116, 2015.
[21] M. Tesic, Z. Andric, “Mobile phone use while driving-literary review”, Transportation Research Part F, 47, 132–142, 2017.
[22] B. Fernandes, M. Alam, V. Gomes, J. Ferreira, A. Oliveira, “Automatic accident detection with multi-modal alert system implementation for ITS”, Vehicular Communications, 3, 1–11, 2016.
[23] W. Hsu, Y. Wang, “ Real-Time Driving Monitor System : Combined Cloud Database with GPS”, Hawaii International Conference on System Sciences, 1740–1748, 2016.
[24] M. Papadakaki, G. Tzamalouka, C. Gnardellis, T. Juhani, J. Chliaoutakis, “Driving performance while using a mobile phone : A simulation study of Greek professional drivers”, Transportation Research Part F: Psychology and Behaviour, 38, 164–170, 2016.
[25] N. Salameh, G. Challita, S. Mousset, A. Bensrhair, S. Ramaswamy, “Collaborative positioning and embedded multi-sensors fusion cooperation in advanced driver assistance system”, Transportation Research Part C, 29, 197–213, 2013.
[26] B. Giri, Ravi Singh Pippal, “Agricultural Environmental Sensing Application Using Wireless Sensor Network for Automated Drip Irrigation”, International Journal of Computer Sciences and Engineering, Volume-4, Issue-7, 2016.
Citation
J. Kanimozhi, R. Subramanian, "Driver Behavior Monitoring and Alerting System Using Samrt Phone," International Journal of Computer Sciences and Engineering, Vol.6, Issue.2, pp.104-111, 2018.
Entry-Exit event detection from video frames
Research Paper | Journal Paper
Vol.6 , Issue.2 , pp.112-118, Feb-2018
CrossRef-DOI: https://doi.org/10.26438/ijcse/v6i2.112118
Abstract
Video surveillance has been one of the ubiquitous aspects of life since few decades. However, there are certain places that demand privacy of an individual like washrooms, changing rooms, baby feeding rooms at airports, etc where cameras cannot be installed / are restricted. Thus, it has raised concerns about safety and security of the public. The objective of our research is to design and analyze the processes and various conceptual models to automate the Entry-Exit surveillance of the people entering into or exiting from the Camera restricted areas. As part of the objective, in this paper, work is carried out to detect or determine the Entry-Exit events using the video frames captured at the entrances of the camera restricted areas by analyzing the variations in histograms of colors-RGB in the video frames using Histogram distance measures. Few grids in the Camera View Scene are selected by continuous learning and are extracted to determine the events happening in the scene thus contributing to improvement in computing time. Confirmation of event happening and classifying it as Entry or Exit or Miscellaneous is presented by temporal analysis of these grids. Experiments are conducted on few standard data sets like SBM datasets transforming them to our scenario, as well as our manual data sets captured in real time with few assumptions to test the techniques proposed.
Key-Words / Index Term
Computer vision, video surveillance, camera prohibited areas ,color histograms, regression lines
References
[1] Collins, R.T., Lipton, A.J., Fujiyoshi, H., Kanade, T., 2001. Algorithms for cooperative multisensor surveillance. Proc. IEEE 89, 1456–1477.
[2] Maria-Florina Balcan, Avrim Blum, Patrick Pakyan Choi, John Lafferty, Brian Pantano, Mugizi Robert Rwebangira and Xiaojin Zhu, Person Identification in Webcam Images:An Application of Semi-Supervised Learning, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213 USA
[3] Agustina, J.R., Clavell, G.G. The impact of CCTV on fundamental rights and crime prevention strategies: The case of the Catalan Control Commission of Video surveillance Devices. computer law & security review. 2011, 27, 168-74.
[4] Jeong, J., Gu, Y., He, T., Du, D.H.C. Virtual Scanning Algorithm for Road Network Surveillance. IEEE Transactions On Parallel And Distributed Systems. 2010, 21, 1734-49.
[5] Leotta, M.J., Mundy, J.L. Vehicle Surveillance with a Generic, Adaptive, 3D Vehicle Model. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2011, 33, 1457-69.
[6] Rougier, C., Meunier, J., St-Arnaud, A., Rousseau, J. Robust Video Surveillance for Fall Detection Based on Human Shape Deformation. IEEE Transactions on Circuits and Systems for Video Technology. 2011, 21, 611-22.
[7] Yigithan Dedeoglu, Moving Object Detection,Tracking And Classification For Smart Video Surveillance, a thesis submitted to the Department of Computer Engineering and the Institute of Engineering and science of Bilkent University.
[8] Mrinali M. Bhajibhakare, Pradeep K. Deshmukh, To Detect and Track Moving Object for Surveillance System, International Journal of Innovative Research in Computer and Communication Engineering Vol. 1, Issue 4, June 2013
[9] Kuihe Yang, Zhiming Cai, Lingling Zhao, Algorithm Research on Moving Object Detection of Surveillance Video Sequence, Optics and Photonics Journal, 2013, 3, 308-312
[10] Xiaogang Wang , “Intelligent multi-camera video surveillance: A review”, Pattern Recognition Letters 34(2013) 3-19
[11] Domenico Daniele Bloisi, “Visual Tracking and Data Fusion for Automatic Video Surveillance”, SAPIENZA Universita di Roma, September 2009
[12] Arun Hampapur, Lisa Brown, Jonathan Connell, Ahmet Ekin, Norman Haas, Max Lu, Hans Merkl, Sharath Pankanti, Andrew Senior, Chiao-Fe Shu, and Ying Li Tian, ”Smart Video Surveillance”, IEEE Signal Processing Magazine, March 2005
[13] Zhiyuan Shi, Timothy.M.Hospedales, Tao Xiang, “Transferring a Semantic Representation for Person Re-Identification and Search”, CVPR 2015.
[14] Dong Seon Cheng and Marco Cristani Person, “Re-identification by Articulated Appearance Matching“, Dept. of Computer Science & Engineering, HUFS, Korea
[15] C.-H. Kuo, S. Khamis, and V. Shet. Person re-identification using semantic color names and rankboost. In WACV, 2013.2
[16] R. Layne, T. Hospedales, and S. Gong. Person Reidentification, chapter Attributes-based Re-identification. Springer, 2014. 1, 2, 3, 6, 8.
[17] S. Khamis, C.-H. Kuo, V. K. Singh, V. Shet, and L. S. Davis. Joint learning for attribute-consistent person reidentification. In ECCV Workshop on Visual Surveillance and Re-Identification, 2014. 2
[18] D. Gray and H. Tao. Viewpoint invariant pedestrian recognition with an ensemble of localized features. In ECCV, 2008. Chapter 2, 6.
[19] H. Wang, S. Gong, and T. Xiang. Unsupervised learning of generative topic saliency for person re- dentification. In BMVC, 2014. 2, 3, 5, 6
[20] Y. Xu, L. Lin, W.-S. Zheng, and X. Liu. Human reidentification by matching compositional template with cluster sampling. In ICCV, 2013. 2
[21] Cheng, D.S., Cristani, M., Stoppa, M., Bazzani, L., Murino, V.: Custom pictorial structures for re-identi_cation. In: Proc. BMVC. (2011)
[22] Stauffer C, Grimson W (1999) Adaptive background mixture models for real-time tracking. IEEE Comput Soc Conf Comput Vis Pattern Recogn 2:246–252
[23] Goyal, K. & Singhai, J. Review of background subtraction methods using Gaussian mixture model for video surveillance systems, Artif Intell Rev (2017). https://doi.org/10.1007/s10462-017-9542-x
[24] Garima Mathur, Mahesh Bundele, Research on Intelligent Video Surveillance techniques for suspicious activity detection critical review, International Conference on Recent Advances and Innovations in Engineering (ICRAIE), 2016.
[25] Zheng J, Wang Y, Nihan N, Hallenbeck E (2006) Extracting roadway background image: a mode based approach. J Transp Res Rep 1944:82–88
[26] Pinto RC, Engel PM. A fast incremental Gaussian mixture model. PLoS ONE 2015;10(10):e0139931 doi: 10.1371/journal.pone.0139931 [PMC free article] [PubMed]
[27] S.Indu and S. chaudhury, “Optimal sensor placement for surviellence of large spaces,” Proceedings of ACM/IEEE International conference on Distributed Smart Cameras, Sepember 2009.
[28] R. Al-Hmouz, S. Challa, "Optimal Placement for Opportunistic Cameras Using Genetic Algorithm", ICISSNIP, pp. 337-341, 2005.
[29] Rangarajan, L., Nagabhushan, P., 2000. A new method for pattern classification through dimensionality reduction based on regression analysis. In: Proc. Indian Conf. Computer Vision, Graphics Image Process., December 20– 22, 2000.
[30] S. Gulliver, G. Ghinea, "Stars in their eyes: What eye-tracking reveals about multimedia perceptual quality", IEEE Trans. Syst. Man Cybern. A Syst. Humans, vol. 34, no. 4, pp. 472-482, Jul. 2004
[31] M. Camplani, L. Maddalena, G. Moyà Alcover, A. Petrosino, L. Salgado, A Benchmarking Framework for Background Subtraction in RGBD videos, in S. Battiato, G. Gallo, G.M. Farinella, M. Leo (Eds), New Trends in Image Analysis and Processing-ICIAP 2017 Workshops, Lecture Notes in Computer Science, Springer, 2017
Citation
Vinay Kumar V, P Nagabhushan, "Entry-Exit event detection from video frames," International Journal of Computer Sciences and Engineering, Vol.6, Issue.2, pp.112-118, 2018.
Design and Development of RFID based Software Framework Prototype for Smart Home
Research Paper | Journal Paper
Vol.6 , Issue.2 , pp.119-124, Feb-2018
CrossRef-DOI: https://doi.org/10.26438/ijcse/v6i2.119124
Abstract
The concept of home automation for realizing the remote access cum control of electrical appliances has been migrating to the concept of smart environment by the rapid incorporation of the information and communications technologies. In this regard, several research works are currently going on all around the globe by different researchers of different technical fields at different levels. This work is to design an efficient software framework for smart home environment through the use of RFID communication technology for identifying the presence of inhabitants individually and also for providing the required services accordingly from the environment based on previous behaviors of the individuals. One algorithm/ method has been introduced in this work to identify the user on his/ her presence in the environment and also to access the required information from the system database about the services, as per his/ her previous settings of the appliances. Again another one data mining based algorithm is also introduced in this work in order to learn the association of the appliances available in the environment so that proactive services from the environment can be initiated. The work is mainly to focus over the sensing and processing part of the proposed smart home environment, rather than giving stress over the deployment of real actuators and hence the status of the appliances has been shown in GUI based platform. This work concludes with challenges related to the smart home environment in order to make the entire technology more efficient and robust.
Key-Words / Index Term
RFID, Smart Home, Data Mining, RS 232 Serial Communication, Qt, MySQL databse
References
[1] S. Kumar, M. A. Qadeer, “Application of AI in Home Automation”, International Journal of Engineering and Technology, Vol.4, No.6, pp.803 -807, 2012.
[2] S. Palaniappan, N. Hariharan, N. T. Kesh, S. Vidhyalakshimi, A. S. Deborah , “Home Automation Systems - A Study”, International Journal of Computer Applications, Vol.116, No.11, pp.11-18, 2015.
[3] M. S. Soliman, M. O. Dwairi, I. I. M. A. Sulayman, S. H. A. Almalki, “Towards the Design and Implementation a Smart Home Automation System Based on Internet of Things Approach”, International Journal of Applied Engineering Research, Vol. 12, No.11, pp. 2731-2737, 2017.
[4] D. J. Cook, S. K. Das, “Smart Environments: Technology, Protocols and Applications”, Wiley-Interscience, 2005.
[5] E. O. Heierman, D. J. Cook, “Improving home automation by discovering regularly occurring device usage patterns”, In the Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM), FL, USA, 2003.
[6] D. J. Cook, M. Huber, K. Gopalratnam, M. Youngblood, “Learning to Control a Smart Home Environment”, American Association for Artificial Intelligence, 2003.
[7] L. Xuemei, X. Gang, L. Li, “RFID Based Smart Home Architecture for improving lives”, In the Proceedings of the ASID 2nd International Conference, Guiyang, CHINA, pp.440-443, 2008
[8] H. Hsu, C. Lee, Y. Chen, “An RFID-based reminder system for smart home”, In the Proceedings of the IEEE International Conference on Advanced Information Networking and Applications (AINA), Singapore, pp. 264-269, 2011.
[9] L. Dongre, G. L. Prajapati, “The Role of Apriori Algorithm for Finding the Association Rules in Data Mining”, In the Proceedings of International Conference on Issues and Challenges in Intelligent Computing Techniques (ICICT), Ghaziabad, INDIA, pp. 657-660, 2014.
Citation
Vaskar Deka, Shikhar Kumar Sharma, "Design and Development of RFID based Software Framework Prototype for Smart Home," International Journal of Computer Sciences and Engineering, Vol.6, Issue.2, pp.119-124, 2018.
Simulating and Analyzing the Behavior of Table-Driven and On-Demand Routing Protocol
Research Paper | Journal Paper
Vol.6 , Issue.2 , pp.125-129, Feb-2018
CrossRef-DOI: https://doi.org/10.26438/ijcse/v6i2.125129
Abstract
Routing is a mechanism to find an optimal route from a source node to destination which is the responsibility of routing protocols. Two prominent routing protocols are reactive or on-demand routing protocols and proactive or table-driven routing protocols. Both types of protocols are efficient in themselves. Performance evaluation of protocols by using performance metrics such as PDR, Average End to End delay, Routing Overhead and throughput etc. is an important aspect in estimating the efficiency of protocols. It helps in making choice of protocols according to the network environment and conditions. This paper describes routing behavior of on-demand routing protocols (DSR, AODV) and table-driven routing protocol (DSDV). Simulations of these three protocols have been performed on NS-2 by varying pause time and speed and then results have been analyzed.
Key-Words / Index Term
AODV, DSDV, DSR, Metrics, PDR, Routing, Simulation
References
[1] Doina Bein, "Self-Configuring, Self-Organizing, and Self-Healing Schemes in Mobile Ad Hoc Networks," in Guide to Wireless Ad Hoc Networks, Sudip Misra, Isaac Woungang, and Subhas Chandra Misra, Eds.: Springer London, 2009, ch. 2, pp. 27-41.
[2] K Fan, S Liu, and P Sinha, "Ad-hoc Routing Protocols," in Algorithms and Protocols for Wireless and Mobile Networks, A. Boukerche, Ed.: CRC/Hall, 2005, pp. 183-215.
[3] S. Deepa and G. M. Kadhar Nawaz, "Mobility and Density Aware AODV Protocol Extension for Mobile Adhoc Networks-MADA-AODV.," Journal of Computer Science, vol. 8, no. 1, pp. 13-17, 2012.
[4] David B. Johnson and David A. Maltz, "Dynamic Source Routing in Ad Hoc Wireless Networks.," in Mobile Computing.: Kluwer Academic, 1996, ch. 5, pp. 153-181.
[5] C. E. Perkins, E. M. Royer, S. R. Das, and M. K. Marina, "Performance Comaprison of Two On-Demand Routing Protocols for Ad Hoc Networks," in IEEE, 2001, pp. 16-28.
[6] A.H. Abd Rahman and Z.A. Zukarnain, "Performance Comparison of AODV, DSDV and IDSDV Routing Protocols in Mobile Ad-hoc Networks," E..J of Scientific Research, vol. 31, no. 4, 566-576.
[7] Muhammad Awais Nawaz, Dr Mudassar Iqbal, Saleem Khan, Zia ul Haq Zafar Mahmood, "Varying Pause Time Effect on AODV, DSR and DSDV Performance," International Journal of Wireless and Microwave Technologies, vol. 5, no. 1, pp. 21-33, March 2015.
[8] Nasru Minallah, Sadiq Shah,Shahzad Rizwan,Hameed Hussain Muhammad Shoaib, "Investigating the Impact of Group mobility models over the On-Demand Routing Protocol in MANETs," in Eighth International Conference on Digital Information Management (ICDIM), 2013, pp. 29-34.
Citation
Swati Atri, Sanjay Tyagi, "Simulating and Analyzing the Behavior of Table-Driven and On-Demand Routing Protocol," International Journal of Computer Sciences and Engineering, Vol.6, Issue.2, pp.125-129, 2018.
Performance Study on Diabetic Disease Prediction Using Classification Techniques
Research Paper | Journal Paper
Vol.6 , Issue.2 , pp.130-135, Feb-2018
CrossRef-DOI: https://doi.org/10.26438/ijcse/v6i2.130135
Abstract
Data mining techniques can be used by Health organizations to identify the diseases like heart, tumor, diabetic, liver and thyroid disease using symptoms as parameters. Diabetic disorder is one of the growing diseases worldwide currently faced by people because of modified life style. Valuable data can be observed from application of knowledge mining techniques in the fitness care system particularly in Diabetic Disease. In this direction, this research paper studies the performance of three classifier algorithms available, namely JRip, PART and Random Tree using WEKA tool and proposed a new algorithm Weighted Classifier to classify the data a diabetic data set. The objective of this research is to classify data, assist the people by extracting useful knowledge from classified data and identify the efficient algorithm to best prediction of disease. From the experimental analysis, it is concluded that weighted Classifier is the effective algorithm for classification accuracy. The result will help doctors in a diagnosis process.
Key-Words / Index Term
Data mining, Diabetes disease, JRip, PART, Random Tree, Weighted Classifier, classification, WEKA tool
References
[1] P. Yasodha , M. Kannan M, “Analysis of Population of Diabetic Patient Database in WEKA Tool”, International Journal of Science and Engineering Research, VoL.2 Issue.5, 2011.
[2] S. Vijayarani , S. Sudha, “Comparative Analysis of Classification Function Techniques for Heart Disease Prediction”, International Journal of Innovative Research in Computer and Communication Engineering, Vol.1, Issue.3, pp.735-741, 2013.
[3] Dr.V.Karthikeyani , I.Parvin Begum “Comparison a Performance of Data Mining Algorithms (CPDMA) in Prediction Of Diabetes Disease” International Journal on Computer Science and Engineering (IJCSE) Vol. 5 No. 03 Mar 2013 205-210
[4] S. Tirunagari, N. Poh, K.Aliabadi, D.Windridge & D.Cooke, “Patient level analytics using self-organising maps: A case study on Type-1 Diabetes self-care survey responses”. In Computational Intelligence and Data Mining (CIDM), IEEE Symposium on pp. 304-309, 2014.
[5] N. Singh, A. Jindal, “A Segmentation Method and Comparison of Classification Methods for Thyroid Ultrasound Images”, International Journal of Computer Applications, Vol.50, Issue.11, 2012.
[6] D.R.Adidela , D.G.Lavanya ,S.G. Jaya,A.R. Allam , “Application of fuzzy ID3 to predict diabetes”. International Journal Advance Computer Mathematics Science, Vol.3, Issue.4, pp.541, 2012.
[7] M. Durairaj ,G. Kalaiselvi , “ Prediction Of Diabetes Using Soft Computing Techniques- A Survey”, International Journal of Scientific & Technology Research, Vol.4, Issue.3, 2015.
[8] A. Rajput, R.P.Aharwal, M. Dubey, S.P. saxena “J48 and JRIP Rules for E-Governance Data” International Journal of Computer Science and Security, Vol.5, Issue.2, pp.201-207, 2011.
[9] E. Frank, Ian H. Witten, “Generating Accurate Rule Sets Without Global Optimization”. In Fifteenth International Conference on Machine Learning, pp.144-151, 1998.
[10] M. H. Danham, S.Sridhar,” Data mining, Introductory and Advanced Topics”, Pearson education, 1st ed., 2006.
[11] R. Remco, Bouckaert, E. Frank, M. Hall, R. kirkby, P.Reutemann, A.Seewald, D. Scuse, “WEKA Manual for Version 3-7-5”, 2011.
[12] Dr. V. Karthikeyini, I. Parvin Begum,” Comparison a Performance of Data Mining Algorithms (CPDMA) in Prediction Of Diabetes Disease”, International Journal on Computer Science and Engineering (IJCSE), Vol.5 Issue.3, 2013.
[13] P.P.Dhakate, S. Patil, K. Rajeswari, D.Abin “Preprocessing and Classification in WEKA Using Different Classifier”, International Journal of Engineering Research and Applications, Vol.4, Issue.8, pp.91-93, 2014
[14] I.Parvin begum, V. Karthikeyini, K. Tajuddin, I. Shahina Begum, “Comparative of data mining classification algorithm (CDMCA) in Diabetes Disease Prediction”, International journal of Computer Applications, Vol.60, Issue.12, pp. 26-31, 2012.
[15] K. Rajesh , V. Sangeetha, “Application of data mining methods and techniques for diabetes diagnosis” . International Journal of Engineering and Innovative Technology (IJEIT), Vol.2,Issue.3, pp.224.
Citation
P. Hema, K. Palanivel, "Performance Study on Diabetic Disease Prediction Using Classification Techniques," International Journal of Computer Sciences and Engineering, Vol.6, Issue.2, pp.130-135, 2018.
Recognition of a Medieval Indic-‘Modi’ Script using Empirically Determined Heuristics in Hybrid Feature Space
Research Paper | Journal Paper
Vol.6 , Issue.2 , pp.136-142, Feb-2018
CrossRef-DOI: https://doi.org/10.26438/ijcse/v6i2.136142
Abstract
The ‘Modi’ script originated as a cursive variant of the script during the 17th century CE and used to write the Marathi language spoken in the Indian state of Maharashtra. Modi script evolved over time and found in many styles of writing. There is no standardization for writing characters and numerals of ‘Modi’ script but largely written without lifting the pen. The cursive nature of the script and lack of standardization in writing style pose challenges in digital recognition of documents written using Modi script including historical ones. Being largely medieval era script, modern document recognition systems lack support for recognizing handwritten texts using ‘Modi’ script. In this paper, we have described the framework of digital recognition of characters of handwritten ‘Modi’ script using empirically determined heuristics for determining the contribution of features from hybrid feature space for recognition of the ‘Modi’ character. The hybrid feature space uses normalized chain code together with feature vector encompassing a number of holes, endpoints, and zones associated with the character. The proposed framework for digital recognition of ‘Modi’ character using empirically determined heuristics provides a naïve model for recognizing a class of Indic scripts especially based on the cursive style of writing. The average and best recognition performance for the proposed method was measured to be 91.20% and 99.10% respectively.
Key-Words / Index Term
Chain Code, OCR, Medieval Script, ‘Modi’ Script Recognition, Empirical Heuristic-based OCR
References
[1] R.M.K.Sinha, “Rule based contexual post-processing for Devanagari text recognition”, Pattern Recognition, 20(5), pp. 475-485, 1987.
[2] Veena Bansal, R. M. K. Sinha, “Segmentation of touching and fused Devnagari characters”, Indian Conference on Computer Vision, Graphics and Image Processing (ICVGIP`98),371 - 376, December 21-23, New Delhi, 1998
[3] R. M. K. Sinha, H. N. Mahabala, “Machine Recognition of Devanagari Script”, IEEE International Conference on Systems, Man and Cybernetics, pp. 435-441, 1979.
[4] Bansal, V. ; Sinha, R.M.K. A Complete OCR for Printed Hindi Text in Devanagari Script, Sixth International Conference on Document Analysis and Recognition, 2001. Proceedings.
[5] A S Ramteke, G S Katkar, Recognition of Off-line Modi Script : A Structure Similarity Approach, “International Journal of ICT and Management” ISSN No. 2026-6839, February 2013
[6] D. N. Besekar, A S Ramteke, “Theoretical analysis of MODI script according to recognition point of view, some issues involved with character recognition of MODI script”, International Journal of Computer Applications, February 2013
[7] D. N. Besekar, “Recognition Of Numerals Of Modi Script Using Morphological Approach”,Shodh Samiksha Aur Mulyankan Vol.III, Issue-27, april 2011
[8] Anil K. Jain, Template-based online character recognition, Pattern Recognition, Volume 34, Issue 1, January 2001, Pages 1–14
[9] D. N. Besekar, A S Ramteke, “Chain Code Approach For Recognizing Modi Neumerals , Indian Journal Of Applied Research”, December 2011
[10] Guojun Lu. “Chain Code-Based Shape Representation and Similarity measures", Visual Information Systems, 1997,Springer Berlin Heidelberg, 1997
[11] Nor Amizam Jusoh and Jasni Mohamad Zain, Application of Freeman Chain Codes: An Alternative Recognition Technique for Malaysian Car Plates”, IJCSNS International Journal of Computer Science and Network Security, VOL.9 No.11, November 2009
[12] Sadanand A. Kulkarni et al, "Offline Handwritten MODI Character Recognition Using HU, Zernike Moments and Zoning", arXiv:1406.6140 , 2014
[13] Dos Santos, Text Line Segmentation Based on Morphology and Histogram Projection, 10th International Conference on Document Analysis and Recognition, 2009. ICDAR `09.
[14] V.Di Lecce, G.Dimauro, A.Guerriero, S.Impedovo, G.Pirlo, A.Salzo, Zoning Design For Hand-Written Numeral Recognition, Proceedings of the Seventh International Workshop on Frontiers in Handwriting Recognition, 2000
[15] Sang Hak Lee, Hyung Il Koo, Nam Ik Cho, “Image segmentation algorithms based on the machine learning of features”, Published in Pattern Recognition Letters, Volume 31 Issue 14, pp. 2325-2336,October, 2010.
[16] Hung-Ming Sun, “Multi-Linguistic Optical Font Recognition Using Stroke Templates”, Proceedings of the 18th International Conference on Pattern Recognition - Volume 02 , Volume 02, August 2006.
[17] John Cowell, Fiaz Hussain, “Two template matching approaches to Arabic, Amharic and Latin isolated characters recognition”, Machine Graphics & Vision International Journal , Volume 14 Issue 2, pp. 213-232, Jan 2005
[18] Zabih, R. Kolmogorov V, “Spatially coherent clustering using graph cuts”, Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Vol 2, pp. 437-444, June 2004.
[19] Mohammed Ali Qatran G, “Template matching method for recognition musnad characters based on correlation analysis”, ACIT` Proceedings, 2011
[20] Vassilis Papavassiliou, ThemosStafylakis, VassilisKatsouros, GeorgeCarayannis, “Handwritten document image segmentation into text lines and words”, Pattern Recognition, Volume 43 Issue 1, pp. 369-377 January 2010.
[21] Tanmoy Som, Sumit Saha, “A new approach for slant angle correction and character segmentation of handwritten document”, social science research network,2008.
[22] Saha, Sumit, “Handwritten Character Recognition Using Fuzzy Membership Function”, 2008 International Journal of Emerging. Technologies in Sciences and Engineering,Vol.5, No.2, pp. 11-15, Dec 2011.
[23] Swapnil Khedekar , Vemulapati Ramanaprasad , Srirangaraj Setlur , Venugopal Govindaraju, “Text–Image Separation in Devanagari Documents”, Proceedings of the Seventh International Conference on Document Analysis and Recognition, p.1265, August 03-06, 2003
[24] Rafael Palacios, Amar Gupta, “Training neural network for reading handwritten amount of checks”, Working Paper 4365-02, May 2002.
[25] S. Basavaraj Patil, N V Subbareddy, “Neural network based system for script identification in Indian documents”, Sadhana Vol. 27, Part 1, February 2002, pp. 83–97.
[26] V. Bansal, R.M.K. Sinha, “Partitioning and Searching Dictionary for Correction of Optically-Read Devanagari Character Strings”, Proceedings of the international conference on Document Analysis and Recognition (ICDAR-99), Bangalore, India, pp. 653- 656, 1999
[27] M. Hanmandlu, Harish Kumar, K. R. Murli Mohan, “Neural Based Handwritten Character Recognition”, Proceedings of the Fifth International Conference on Document Analysis and Recognition (ICDAR), pp 241 , 1999.
[28] Thein M. Ha, Horts Bunke, Off-Line, “Handwritten Numeral Recognition by Perturbation Method”, IEEE Transactions on Pattern Analysis and Machine Intelligence archive Volume 19 , Issue 5 (May 1997) pp 535 - 539
[29] B.B. Chaudhuri, U. Pal, “An OCR system to read two Indian language scripts: Bangla and Devanagari”, Proceedings of 4th International Conference on Document Analysis and Recognition, pp. 1011-1015, 1997.
Citation
R. K. Maurya, S. R. Maurya, "Recognition of a Medieval Indic-‘Modi’ Script using Empirically Determined Heuristics in Hybrid Feature Space," International Journal of Computer Sciences and Engineering, Vol.6, Issue.2, pp.136-142, 2018.
An Association Rule Based Model for Discovery of Eligibility Criteria for Jobs
Research Paper | Journal Paper
Vol.6 , Issue.2 , pp.143-149, Feb-2018
CrossRef-DOI: https://doi.org/10.26438/ijcse/v6i2.143149
Abstract
Association rule mining is a data mining technique in which pattern of occurrences of one set of items with another set of items in databases of transactions are discovered as rules of implications with certain measures of interestingness. Support or the frequency of occurrences of sets of items and confidence are the most widely used measures of interestingness of association rules of the form X→Y where X and Y are disjoint sets of items. Though the problem of association rule mining emerged from analysis of market basket data in supermarket there are numerous areas of applications of association rule mining technique. In this paper, an association rule based model for discovery of eligibility criteria for jobs is proposed. For this the eligibility requirements of jobs are converted to a set of transactions and then a data base of such transactions is prepared for discovering the association rules in such a way that the antecedent of a rule represents the eligibility requirements and the consequent represents the concerned job. Such rules once discovered can be used for various purposes by the employers, job seekers and the policy makers for proper planning related to recruitment, employment and creation of need based vacancies respectively.
Key-Words / Index Term
Data mining, big data, association rule, support, confidence, classification
References
[1] A. Gupta, D. Garg, “Applying Data Mining Techniques in Job Recommender System for Considering Candidate Job Preferences”, In the Proceedings of International Conference on Advances in Computing, Communications and Informatics (ICACCI), pp. 1458- 1465, 2014.
[2] L. Wang, C. Yi, “Application of Association Rules Mining In Employment Guidance”, Advanced Materials Research Vols. 479-481, pp 129-132.
[3] C. Chien, L. Chen, “Data Mining to Improve Personnel Selection and Enhance Human Capital: A Case Sstudy in High-Technology Industry”, Expert Systems with applications, Vol. 34, No. 1, pp. 280-290, 2008.
[4] B. Jantawan, C. Tsai, “The Application of Data Mining to Build Classification Model for Predicting Graduate Employment”, International Journal of Computer Science and Information Security, 2013.
[5] T. Mishra, D. Kumar, S. Gupta, “Students’ Employability Prediction Model through Data Mining”, International Journal of Applied Engineering Research, Volume 11, Number 4, pp 2275-2282, 2016.
[6] M. Sapaat, A. Mustapha, J. Ahmad, K. Chamili, and R. Muhamad, “A Data Mining Approach to Construct a Graduates Employability Model in Malaysia, ” International Journal of New Computer Architectures and their Applications, Vol. 1, No. 4, pp. 1086-1098, 2011.
[7] I. A. Wowczko, “Skills and Vacancy Analysis with Data Mining Techniques”, Informatics, Vol. 2, pp. 31-49, 2015.
[8] N. N. Salvithal, R.B. Kulkarni, “Appraisal Management System using Data mining Classification Technique”, International Journal of Computer Applications, Volume 135, No.12, 2016.
[9] J. Han, M. Kamber, “Data Mining: Concepts and Techniques”, Morgan Kaufmann, San Fransisco, USA, 2011.
[10] M. S. Chen, J. Han, P. S. Yu, “Data Mining: An Overview from a Database Perspective”, IEEE Transactions on Knowledge and Data Engineering (TKDE), Vol. 8, No. 6, pp. 866-883, 1996.
[11] R. Agrawal, T. Imielinsky, A. Swami, “Mining Association Rules Between Sets of Items in Large Databases”, In the Proceedings of ACM SIGMOD Intl. Conference on Management of Data, USA, pp207 -216, 1993,.
[12] R. Agrawal, T. Imielinsky, A. Swami, “Database Mining: A performance perspective”, IEEE Transactions on Knowledge and Data Engineering, Vol. 5 pp.914 – 925,1993.
[13] R. Agrawal, R. Srikant, “Fast Algorithms for Mining Association Rules in Large Databases”, In the Proceedings of 20th International Conference on Very Large Databases, Chile, pp 487 – 499, 1994.
[14] K. S. Divya, P.Bhargavi, S. Jyothi, “Machine Learning Algorithms in Big data Analytics”, International Journal of Computer Sciences and Engineering, Vol. 6, No. 1, pp. 63-70, 2018.
Citation
P. K. Deva Sarma, "An Association Rule Based Model for Discovery of Eligibility Criteria for Jobs," International Journal of Computer Sciences and Engineering, Vol.6, Issue.2, pp.143-149, 2018.