@article {846, title = {Can ChatGPT Predict Stock Market Price Movements?}, journal = {Journal of Digital Information Management}, volume = {22}, year = {2024}, month = {09/2024}, pages = {91-98}, type = {Research}, chapter = {91}, abstract = {

Accelerated advances in network speed, re- liability, and security have increased the demand for soft- ware and services to move from being stored and pro- cessed locally on users{\textquoteright} devices to being managed by third parties that can be accessed through the network. This has led to the need to develop new software archi- tectures and software architectures that meet these new requirements. One example of software architecture is the recent emergence of a microservices architecture to meet online service providers{\textquoteright} maintenance and scalability requirements. Microservices is an architecture style that focuses on breaking down a system into small, lightweight services that are intentionally created to perform a highly cohesive business function, and it is an evolution of the traditional service-oriented architecture style. The practi- cal projection of microservices architecture in informa- tion engineering is several small applications that work together to provide an integrated service that appears to the external medium as a single application. Each of these applications has its own independent source code and deals with data sources that are different from the rest. As a result, it has an independent development team. Partial applications depend on each other to accomplish their functions, and therefore, any modification to one of the services will affect the work of the rest of the ser- vices; in large applications that require keeping the sys- tem always available, we must perform the process of publishing updates for parts of the system without stop- ping it completely, so we must monitor the impact of modi- fications and forecast system status before new updates are deployed. In achieving this prediction, we must know the dependencies between different services to arrive at a cognitive model representing the dependencies between services or applications.

}, doi = {https://10.0.23.137/jdim/2024/22/3/91-98}, url = {http://www.dline.info/jdim/wp-content/uploads/2.pdf}, author = {Ammar Esrawi and Bassel Alkhatib} } @article {734, title = {Convolutional Neural Networks for Handwritten Text Recognition of Medical Prescription-}, journal = { Journal of Digital Information Management}, volume = {21}, year = {2023}, month = {12/2023}, pages = {117--124}, chapter = {117}, abstract = {

Converting handwritten prescriptions into electronic format offers several advantages and is crucial for modern healthcare systems. It is essential nowadays because of some factors such as {\textendash} Legibility and Accuracy: Handwritten prescriptions can be challenging to read and interpret; accessibility and Portability: Electronic prescriptions can be easily stored; Decision Support Systems: By digitising prescriptions, healthcare systems can integrate them with electronic health records (EHRs) and utilise decision support systems. Convolutional neural networks (CNNs) are a class of deep learning algorithms that have proven effective in extracting handwritten text from various documents, including medical prescriptions. By leveraging CNNs for handwritten text extraction, healthcare systems can automate the process of digitising prescriptions, reducing manual effort and potential human errors. This enables seamless integration with electronic systems, facilitating better patient care and overall healthcare management. In this paper, we have trained the CNN model for different parameters and observed the accuracy and loss for various parameters. We got a maximum training accuracy of 89\% and a maximum testing accuracy of 70\%.

}, doi = {https://doi.org/10.6025/jdim/2023/21/4/117-124}, url = {https://www.dline.info/fpaper/jdim/v21i4/jdimv21i4_3.pdf}, author = {Makarand Shahade and Mayuri Kulkarni and Vivek Pawar and Jatin Chaudhari and Yash Lakade and Darshan Kotkar} } @article {744, title = {Convolutional Neural Networks for Handwritten Text Recognition of Medical Prescription-}, journal = {Journal of Digital Information Management}, volume = {21}, year = {2023}, month = {12/2023}, pages = {117-124}, type = {Research}, chapter = {117}, abstract = {

Converting handwritten prescriptions into electronic format offers several advantages and is crucial for modern healthcare systems. It is essential nowadays because of some factors such as {\textendash} Legibility and Accuracy: Handwritten prescriptions can be challenging to read and interpret; accessibility and Portability: Electronic prescriptions can be easily stored; Decision Support Systems: By digitising prescriptions, healthcare systems can integrate them with electronic health records (EHRs) and utilise decision support systems. Convolutional neural networks (CNNs) are a class of deep learning algorithms that have proven effective in extracting handwritten text from various documents, including medical prescriptions. By leveraging CNNs for handwritten text extraction, healthcare systems can automate the process of digitising prescriptions, reducing manual effort and potential human errors. This enables seamless integration with electronic systems, facilitating better patient care and overall healthcare management. In this paper, we have trained the CNN model for different parameters and observed the accuracy and loss for various parameters. We got a maximum training accuracy of 89\% and a maximum testing accuracy of 70\%.

}, doi = {https://doi.org/10.6025/jdim/2023/21/4/117-124}, url = {http://www.dline.info/download.php?sn=3899}, author = {Makarand Shahade and Mayuri Kulkarni and Vivek Pawar and Jatin Chaudhari and Yash Lakade and Darshan Kotkar} } @article {754, title = {COVID- 19 pandemic {\textendash} An Empirical Study on the Cybersecurity Behaviour of Healthcare Sectors and Employees}, journal = {Journal of Digital Information Management}, volume = {20}, year = {2022}, month = {12/2022}, pages = {115-130}, type = {Research}, chapter = {115}, abstract = {

Earlier research by our team have focussed the multilayer SAM spiking neural network using training algorithms for implementing FPGA. In the current work we have outlined the utilization of SAM-based network for developing function approximation. We have deployed the spike coding model for the work. In the testing we have proved that the {\^a}{\texteuro}{\oe}interpolated XOR{\^a}{\texteuro} and 3-polynominal function approximation of this SAM network. We found that the SAM network has the ability to perform these function approximations to high accuracy.

}, doi = {https://doi.org/10.6025/jdim/2022/20/4/115-130}, url = {http://www.dline.info/download.php?sn=3617}, author = {Harrison Stewart} } @article {782, title = {Comparison of the Effects Stemmer Porter and Nazief-Adriani on the Performance of Winnowing Algorithms for Measuring Plagiarism-}, journal = {Journal of Digital Information Management}, volume = {18}, year = {2020}, month = {04/2020}, pages = {49-56}, type = {Research}, chapter = {49}, abstract = {

Current technological developments change physical paper patterns into digital, which has a very high impact. Positive impact because paper waste is reduced, on the other hand, the rampant copying of digital data raises the amount of plagiarism that is increasing. At present, there are many efforts made by experts to overcome the problem of plagiarism, one of which is by utilizing the winnowing algorithm as a tool to detect plagiarism data. In its development, many optimizing winnowing algorithms used stemming techniques. The most widely used stemmer algorithms include stemmer porter and nazief-adriani. However, there has not been a discussion on the comparison of the effect of performance using stemmer on the winnowing algorithm in measuring the value of plagiarism. So it is necessary to do research on the effect of stemmer algorithms on winnowing algorithms so that the results of plagiarism detection are more optimal. The results of this study indicate that the effect of nazief-adriani stemmer on the winnowing algorithm is superior to the stemmer porter, only decreasing the detection performance of the 0.28\% similarity value while the porter stemmer is superior in increasing the processing time to 69\% faster.

}, doi = {https://doi.org/10.6025/jdim/2020/18/2/49-56}, url = {http://dline.info/fpaper/jdim/v18i2/jdimv18i2_1.pdf}, author = {Alam Rahmatulloh and Neng Ika Kurniati and Irfan Darmawan and Adi Zaenal Asyikin and Deden Witarsyah} } @article {712, title = {A CBR Decision Support System for Loan Evaluation}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {04/2019}, pages = {75-86}, type = {Research}, chapter = {75}, abstract = {

Group decision making is time-consuming, complex, critical and recurring in nature. In group decision making, the decision-makers often perform periodic and repetitive activities. This prompts the decision makers to store their knowledge and their experience invoked in prior problem solving sessions. The development of this group knowledge clearly assists in similar later decision-making activities and reduces the time required to come to a decision, particularly, in a critical situation. This shared knowledge constitutes the group memory. In this paper, we develop a Case-Based Reasoning Decision Support System called CBR-DSS that makes use of the rules, policies and standard procedures of prior groups embedded in the group memory. The CBR process is evolved by using the Analytic Hierarchy Process (AHP). In an effort to enhance utility and show the feasibility, we experiment our approach in a bank loan analysis domain, a semi-structured multiple attributes decision-making environment, and compare CBR-DSS with a conventional case based reasoning system. CBR-DSS will compensate for lack of experience of young bank consultants, and allow disseminating and distributing available experience to different bank sites.

}, keywords = {Case-based Reasoning, Group Decision Making, Group Memory, Information retrieval, Recommender system}, url = {https://doi.org/10.6025/jdim/2019/17/2/75-86}, author = {Abdelkader Adla and Noureddine Benmessaoud} } @article {807, title = {A CBR Decision Support System for Loan Evaluation-}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {04/2019}, pages = {75-86}, type = {Research}, chapter = {75}, abstract = {

Group decision making is time-consuming, complex, critical and recurring in nature. In group decision making, the decision-makers often perform periodic and repetitive activities. This prompts the decision makers to store their knowledge and their experience invoked in prior problem solving sessions. The development of this group knowledge clearly assists in similar later decision-making activities and reduces the time required to come to a decision, particularly, in a critical situation. This shared knowledge constitutes the group memory. In this paper, we develop a Case-Based Reasoning Decision Support System called CBR-DSS that makes use of the rules, policies and standard procedures of prior groups embedded in the group memory. The CBR process is evolved by using the Analytic Hierarchy Process (AHP). In an effort to enhance utility and show the feasibility, we experiment our approach in a bank loan analysis domain, a semi-structured multiple attributes decision-making environment, and compare CBR-DSS with a conventional case based reasoning system. CBR-DSS will compensate for lack of experience of young bank consultants, and allow disseminating and distributing available experience to different bank sites.

}, doi = {https://doi.org/10.6025/jdim/2019/17/2/75-86}, url = {http://dline.info/fpaper/jdim/v17i2/jdimv17i2_3.pdf}, author = {Abdelkader Adla and Noureddine Benmessaoud} } @article {716, title = {Computer and Network Security: Ontological and Multi-agent System for Intrusion Detection}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {06/2019}, pages = {133-144}, type = {Research}, chapter = {133}, doi = {https://doi.org/10.6025/jdim/2019/17/3/133-144}, url = {http://dline.info/fpaper/jdim/v17i3/jdimv17i3_3.pdf}, author = {Samir Bourekkache and Okba Kazar and Ahmed Aloui} } @article {801, title = {Computer and Network Security: Ontological and Multi-agent System for Intrusion Detection-}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {06/2019}, pages = {133-144}, type = {Research}, chapter = {133}, abstract = {

Today the security aspect is a backbone of every computer system, particularly when this system contains sensitive information. When we use our computers and connect to the network or use web services, we trust that our personal and sensitive information (images, passwords, credit card number {\textellipsis}etc) are confidential and well secured by the used security system. Unfortunately, the hackers may succeed to gain access to the system and misuse our information. Generally, the aim of the intrusion is to find new ways to annoy, steal and harm parts of computer systems. Moreover, with the possibility of connecting several computers and networks, the necessity of protecting the whole data and machines from attackers (hackers) that try to get some confident information to use for their own benefit or just destroy or modify valuable information was born. At this point IDS appears to help users, companies or institutions to detect when they are getting compromised. In this paper, we develop an intrusion detection system using multi agent system, ontological techniques (IDSMAO) and misuse method.

}, doi = {https://doi.org/10.6025/jdim/2019/17/3/133-144}, url = {http://dline.info/fpaper/jdim/v17i3/jdimv17i3_3.pdf}, author = {Samir Bourekkache and Okba Kazar and Ahmed Aloui} } @article {795, title = { Corpus-Based Techniques for Sentiment Lexicon Generation: A Review-}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {10/2019}, pages = {296-305}, type = {Research}, chapter = {296}, abstract = {

State-of-the-art sentiment analysis systems rely on a sentiment lexicon, which is the most essential feature that drives their performance. This resource is indispensable for, and greatly contributes to, sentiment analysis tasks. This is evident in the emergence of a large volume of research devoted to the development of automated sentiment lexicon generation algorithms. The task of tagging subjective words with a semantic orientation comprises two core approaches: dictionarybased and corpus-based. The former involves making use of an online dictionary to tag words, while the latter relies on co-occurrence statistics or syntactic patterns embedded in text corpora. The end result is a linguistic resource comprising a priori information about words, across the semantic dimension of sentiment. This paper provides a survey on the most prominent research works that utilize corpus-based techniques for sentiment lexicon generation. We also conduct a comparative analysis on the performance of state-of-the-art algorithms proposed for this task, and shed light on the current progress and challenges in this area.

}, doi = {https://doi.org/10.6025/jdim/2019/17/5/296-305}, url = {http://dline.info/fpaper/jdim/v17i5/jdimv17i5_4.pdf}, author = {Mohammad Darwich and Shahrul Azman Mohd Noah and Nazlia Omar and Nurul Aida Osman} } @article {805, title = {Crawling the Dark Web: A Conceptual Perspective, Challenges and Implementation{\textendash}}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {04/2019}, pages = {51-60}, type = {Research}, chapter = {51}, abstract = {

\ Internet and network technologies have evolved dramatically in the last two decades, with rising users{\textquoteright} demands to preserve their identities and privacy. Researchers have developed approaches to achieve users{\textquoteright} demands, where the biggest part of the internet has formed, the Deep Web. However, as the Deep Web provides the resort for many benign users who desire to preserve their privacy, it also became the perfect floor for hosting illicit activities, which generated the Dark Web. This leads to the necessity of finding automated solutions to support law and security agencies in collecting information from the Dark Web to disclose such activities. In this paper, we illustrate the concepts needed for the development of a crawler that collects information from a dark website. We start from discussing the three layers of the Internet, the characteristics of the hidden and private networks, and the technical features of Tor network. We also addressed the challenges facing the dark web crawler. Finally, we presented our experimental system that fetches data from a dark market. This approach helps in putting a single dark website under investigation, and can be a seed for future research and development.

}, doi = {https://doi.org/10.6025/jdim/2019/17/2/51-60}, url = {http://dline.info/fpaper/jdim/v17i2/jdimv17i2_1.pdf}, author = {Bassel Alkhatib and Randa Basheer} } @article {710, title = {Crawling the Dark Web: A Conceptual Perspective, Challenges and Implementation}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {04/2019}, pages = {51-60}, type = {Research}, chapter = {51}, doi = {https://doi.org/10.6025/jdim/2019/17/2/51-60}, url = {http://dline.info/fpaper/jdim/v17i2/jdimv17i2_1.pdf}, author = {Bassel Alkhatib and Randa Basheer} } @article {689, title = {Cloud Computing Intrusion Detection Using Artificial Bee Colony-BP Network Algorithm}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {08/2018}, pages = {203-209}, type = {Research}, author = {Yang Hui} } @article {825, title = {Cloud Computing Intrusion Detection Using Artificial Bee Colony-BP Network Algorithm-}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {08/2018}, pages = {203-209}, type = {Research}, chapter = {203}, abstract = {

\ Cloud computing characterizes a methodology for computing communications in a much effective manner, and a business paradigm for trading computing resources and services. Alternatively, these difficult and distributed planning{\textquoteright}s turn a striking objective for intruders. Cloud computing provides huge latent for enhancing production and decrease expenditures. However it simultaneously acquires several novel security risks. Intrusion Detection Systems (IDS) have been employed broadly for identifying malicious actions in network communication and hosts. In this work, an artificial bee colony-BP neural network algorithm is applied to the detection module, in order to detect the complicated aggressive behaviors. Through example verification, the artificial bee colony-BP network algorithm has improved intrusion detection efficiency and classification precision, and can effectively guarantee the safety of the cloud computing environment.

}, doi = {https://doi.org/10.6025/jdim/2018/16/4/203-209}, url = {http://dline.info/fpaper/jdim/v16i4/jdimv16i4_5.pdf}, author = {Yang Hui} } @article {623, title = {A Comparative Analysis of the Efficiency of Video Reader Object for Frame Extraction in MATLAB}, journal = {Journal of Multimedia Processing and Technologies}, volume = {9}, year = {2018}, pages = {16-21}, author = {M Nachamai and Joy Paulose and Samuel Marandi} } @article {828, title = {Content Based Text Information Search and Retrieval in Document Images for Digital Library-}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {06/2018}, pages = {136-151}, type = {Research}, chapter = {136}, abstract = {

\ The main objective of this research work is to find the keywords in the captured/scanned print document images in the image database. Document images are becoming more popular in today{\textquoteright}s world and these are used in paperless offices and digital libraries. Information retrieval from the document images is a very challenging task. Hence, there is a need for developing searching strategies to find the required information from these document images as per user{\textquoteright}s needs, becomes very essential in nowadays. Traditionally Optical Character Recognition (OCR) tools are used for information retrieval from the document images, but it{\textquoteright}s not an efficient method. Word spotting is an inventive method for searching the document images and to retrieve relevant information without any conversion. In this work an algorithm Enhanced Dynamic Time Warping was proposed to for finding keywords from document images, it is based on word spotting technique.

}, author = {A. Sakila and S. Vijayarani} } @article {678, title = {Content Based Text Information Search and Retrieval in Document Images for Digital Library}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {06/2018}, pages = {136-151}, type = {Research}, author = {A. Sakila, and S. Vijayarani} } @article {667, title = {A Cross-Layered Approach for Improving Quality of Service of Video Transmission in Ad-hoc Networks}, journal = {Journal of Networking Technology}, volume = {9}, year = {2018}, month = {06/2018}, pages = {48-55}, type = {Research}, author = {Mohammed Yasin Ali and Syed Musthak Ahmed} } @article {480, title = {Comparing network centrality measures as tools for identifying key concepts in complex networks: A case of wikipedia}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {203 - 213}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85026636099\&partnerID=40\&md5=50c7ab8bd294001879ffef604b1bc961}, author = {Matas, N. and Martinci{\'c}-Ip{\v s}i{\'c}, S. and Me{\v s}trovi{\'c}, A.} } @article {487, title = {Computer aided fire safety engineering model based on shortest path algorithm}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {106 - 114}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85021799816\&partnerID=40\&md5=d6600cfbe468d44ff4fc46e50a018498}, author = {Gao, Y. and Zhao, J.} } @article {507, title = {A cloud-assisted architecture for content distribution in mobile peer to peer networks}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Cited By :1Export Date: 22 February 2018}, month = {2016}, pages = {403 - 412}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010972068\&partnerID=40\&md5=478dd69ec164325e2daff594a03ec7d0}, author = {Liu, Y.-N. and Chen, H.-Y. and Gilani, S.M.M.} } @article {521, title = {A clustering with slope algorithm based on mapreduce}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {168 - 176}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84982801686\&partnerID=40\&md5=59c334c0b1dd3e8b94a3cc75d5785e89}, author = {Wang, Y. and Wu, H. and Liang, J. and Ou, J. and Huang, Y.} } @article {509, title = {A combination indexing for image social bookmarking system to improve search results}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {423 - 431}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010950546\&partnerID=40\&md5=b3aac0163118ba5aa45d79a62ae9fd25}, author = {Jomsri, P.} } @article {519, title = {Construction of trust based dynamic access control model in P2P network environment}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {194 - 198}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84982850708\&partnerID=40\&md5=d1a82b733bccde27611b24bd80b75668}, author = {Han, Y. and Cui, X.} } @article {597, title = {Cloud-based government procurement information integration platform}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :2Export Date: 22 February 2018}, month = {2015}, pages = {147 - 155}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84938587940\&partnerID=40\&md5=a0687e73f079a9f60c27328d138c7b97}, author = {Wang, P.Y. and Shen, J. and Guo, W.Q. and Zhang, C. and Zhang, B.} } @article {606, title = {Clustering research across Tibetan and Chinese texts}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {162 - 168}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84938597690\&partnerID=40\&md5=a971739a5ed7e44e809f090f4dd4ade8}, author = {Xu, G.X. and Sun, W. and Peng, X.P.} } @article {578, title = {Collection and selection based relevant degrees of documents}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :1Export Date: 22 February 2018}, month = {2015}, pages = {110 - 119}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84930388004\&partnerID=40\&md5=d5169e26b597ad1d23dfecfc8ece9fe3}, author = {Kheira, M. and Lougmiri, Z. and Kamel, A.M.} } @article {577, title = {Computer graphics algorithm based on visualization teaching theory}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :1Export Date: 22 February 2018}, month = {2015}, pages = {137 - 141}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84938590017\&partnerID=40\&md5=7ae622ba1163d0246f51519817a5ff89}, author = {Wang, F.} } @article {573, title = {Construction and application of teaching file management system in institutions of higher learning based on OpenKM}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {286 - 290}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84956704691\&partnerID=40\&md5=5c0b7f8150eef63ce1be7af402d69597}, author = {Deng, H.} } @article {566, title = {Construction of a Port Logistics Information Platform Based on J2EE: Taking Dushan Port of Jiaxing as an Example}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {328 - 336}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959855788\&partnerID=40\&md5=f78c983c5c37a00819a1a87b052b4c6f}, author = {Shen, Y.Y. and He, A.T.} } @article {613, title = {Cooperation based on decode-and-forward plus cooperative jamming for wireless physical layer security}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :1Export Date: 22 February 2018}, month = {2015}, pages = {92 - 100}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84930397335\&partnerID=40\&md5=2c00e27b64c466fff5637cf109a53174}, author = {Huang, S. and Tan, J. and Jiang, R.} } @article {455, title = {Campsna: A cloud assisted mobile peer to peer social network architecture}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Export Date: 10 July 2014}, month = {2014}, pages = {126 - 132}, abstract = {In the social network, people with same interest construct a group, where people can share their interesting contents. With the popularity of the mobile devices, mobile users can connect to the internet for services such as downloading videos, music and pictures anywhere at any time, which may cause heavy traffic burden on the core network. The service content (eg. video, picture, music) downloaded and shared in the same social network interest group may always be similar, which may lead to repeated traffic transmitted in a short time period; on the other hand, the size of the service content may be very large for a single user, which will take it along time and spend much money to finish a complete service request or sharing. It is necessary to study how to reduce the requests in internet from the mobile users to reduce the flow on the core network, as well as reducing the economic cost and the service time, which is the main motivation of our research. Based on the universal mobile social network architecture, this paper proposed CAMPSNA: a cloud assisted mobile peer to peer social network architecture. In which, the cloud center is introduced to help the mobile devices offloading complex tasks to the cloud. The end devices in the architecture construct a local mobile peer to peer network to share their existing content based on their social relationships to reduce the burden of the cloud center.}, keywords = {Data exchange, Mobile Cloud, Mobile peer to peer Network, Network Architecture, Social Network}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84903137451\&partnerID=40\&md5=eeaa0a8cdbbd54b68c6c7fb395d21692}, author = {Liu, Y.-N. and Tang, H. and Zhao, G.-F.} } @article {401, title = {The computer design of practical filter}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {175 - 178}, abstract = {This paper discussed how to use computer to directly transfer the simulative low pass prototype design to all kinds of needed principles and design methods. This method{\textquoteright}s advantage is that it is very direct, and universal. So, this method is simple, convenient, practical and fast.}, keywords = {Filter, Polynomial shift, Transform matrix}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84880791462\&partnerID=40\&md5=b00b61c35f2558a8a5cc5066cdb53b3d}, author = {Li, Z. and Weixi, Z.} } @article {337, title = {A clustering based forecast engine for retail sales}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {219 - 229}, abstract = {Efficient and accurate sales forecasting is a vital part of creating an efficient supply chain in enterprises. Times series methods are a popular choice for forecasting demand sales. A major challenge is to develop a relatively inexpensive and automated forecasting engine that guarantees a desired forecasting accuracy. Times series decomposition and Forecast combination have been two classes of methods that have attracted the interest of recent researchers. One solution has been to use decomposition followed by recombining to form a very large number of forecasting models Further many recent papers present Data Mining based methods to intelligently discover a subset of methods from a large list that can be used in combination for sales demand forecasting. These methods are computationally expensive and prohibitive if they are applied to each individual time series in a retail organization. In this paper we present a novel technique to identify similar sales series and efficiently use the best combination of methods learnt for one series to forecast for the entire set of similar series.}, keywords = {Bad experts, Combining, Decomposition, Frequent pattern mining, Good experts, Hierarchical clustering, Sales forecasting, Times series}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866437246\&partnerID=40\&md5=483d9ce78ec38199f57ebcb1bca8dc64}, author = {Murlidhar, V. and Menezes, B. and Sathe, M. and Murlidhar, G.} } @article {323, title = {CMCCR: Classification based on multiple class-correlation rules}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {64 - 70}, abstract = {Previous studies show that associative classification achieves higher classification accuracy than traditional classification approaches. However, associative classification suffers from two major deficiencies and thus sometimes has lower classification accuracy. First, it often generates a large number of rules when the minimum support is set to be low. It is not only time consuming to discover so many itemsets, but also very difficult to select high quality rules from a huge set of rules. Second, the association measure confidence does not reflect correlation relationships between itemsets and the class label. To deal these problems, in this paper, we propose a new classification approach called classification based on multiple class-correlation rules (CMCCR). First, we use both support and all-confidence to mine not only frequent but also mutually associated itemsets. This method not only saves the running time but as well considerably reduces the number of itemsets generated, and thus sharply decreases the number of class-correlation rules produced. Second, we use a new correlation measure correlation confidence to discover class-correlation rules. The measure correlation confidence has two bounds:- 1and 1. It is easy to control the correlation degree of the class-correlation rules found. Finally, we use multiple class-correlation rules and average correlation degree to measure the combined effect of group rules. Experimental results on the mushroom data set show that CMCCR has higher and more stable accuracy than associative classification and decision tree method.}, keywords = {All-confidence, Class-correlation rule, Classification, Correlation confidence}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866448185\&partnerID=40\&md5=10fb4c8ff12d02f2555fb4ba4c8f5d04}, author = {Zhou, Z. and Wang, X. and Pan, G.} } @article {320, title = {A comparison of pattern classification approaches for structural damage identification}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {126 - 130}, abstract = {A structural damage identification approach based on wavelet packet decomposition (WPD) and random forests (RF) was proposed and compared with other pattern classification approachs. The main procedure involves extracting energy features from vibration acceleration data through wavelet packet decomposition and then using these features as input for a RF classifier. The experiment was carried on an 8-storey steel shear building model in the case verification. The results show that the proposed method is effective for structure damage detection and can achieve a higher accuracy than other commonly used methods.}, keywords = {Extraction algorithms, Pattern matching, Sensor identificaiton, Wavelet packet decomposition}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866443034\&partnerID=40\&md5=17335eb07404e2de90828f9bb812e1da}, author = {Qingqing, Z. and Qifeng, Z. and Yongpeng, N. and Fan, Y. and Jiayan, L. and Run, T. and Minda, L.} } @article {318, title = {A constrained optimization evolutionary algorithm based on membrane computing}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2012}, pages = {121 - 125}, abstract = {Based on membrane computing (MCCOP for short), a constrained optimization evolutionary algorithm is proposed with the evolutionary operations and strategies designed. In MCCOP, a membrane is associated with a constraint and the tentative solutions evolved according to the rules in the membrane. And it is evaluated by the constraint function value as the fitness. The subpopulations can communicate efficiently during the evolution process by making use of the structure of P systems and the communication mechanism among the membranes. The computational experiments show that MCCOP can converge to optimal or close to optimal solutions efficiently and that MCCOP outperforms or performs similarly to the other techniques referred to in terms of the quality of the resulting solutions.}, keywords = {Constrained optimization, Membrane computing, Optimization algorithm, P system}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866465380\&partnerID=40\&md5=f4dc024e4e87df897034039972862ac9}, author = {Chen, H. and Lu, J.} } @article {354, title = {Creating multi-level class hierarchy for question classification with NP analysis and wordnet}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {379 - 388}, abstract = {Question answering systems provide answer to the questions using various question processing techniques and extracts answers from a set of documents. Finding the exact answer is more interesting and useful than getting a list of documents to look through and find the answer manually. Question answering is not same as a traditional document retrieval search engine where a set of relevant documents are returned in response of the query, whereas, in the question answering systems the response of the query is a concise and exact answer to the question. Typically, Question Classification (QC) is the first step in a Question Answering (QA) system. This phase is responsible for finding out the type of the expected answer by pruning out the extra information that is not relevant to extract the answer. Almost all the previous QC algorithms evaluated their work on the basis of a common class hierarchy already defined. The coarse grained classes Location, Entity and Numeric in the existing hierarchy have a fine grained class Other. We present the framework to create new fine grained classes to replace the Other classes. We also discuss the motivation behind the replacement and how the new fine grained classes may support the answer extraction. Additionally, we also present an automatic hierarchy creation method to add new class nodes using WordNet and Noun phrase parsing.}, keywords = {Meta Information Management, Natural Language Processing, Question Answering4, Question Class Hierarchy, Question Classification}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84874837728\&partnerID=40\&md5=3f2a45281c24dba71e9fbc36717f9a70}, author = {Bakhtyar, M. and Kawtrakul, A. and Baber, J. and Doudpota, S.M.} } @article {285, title = {A combined measure of semantic web and meta tag technology for web retrieval}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {219 - 222}, abstract = {Increasingly web is used for tracking numerous information pieces of large and complex data. Normal way of accessing these sources using web search engines has many limitations and we have enough literature to document them. This study is an enhancement to trap the discovery of targeted information pieces which are normally failed cases in search engines. We use an integrated approach of conventional web search and semantic web by carefully constructed algorithms. The algorithms are tested to track data about the gulf institutions. The experiments provide encouraging results and enable us to draw future directions of research in this domain.}, keywords = {Gulf institutions, Institutions profiles, Semantic web, Web construct data}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855373332\&partnerID=40\&md5=941434981b3a9f7b76faa977d407fee3}, author = {Al Reyaee, S.} } @article {301, title = {Construction of a teaching resources sharing platform based on campus network}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {261 - 265}, abstract = {This paper constructs a teaching resources sharing platform based on campus network, which has integrated the existing digital teaching resources, and collected the scattered resources together and improved the whole unreasonable resources layout, repetitive construction and so on. Since the network is convenient and real-time, it is suited to be applied to the traditional classroom teaching. The teaching resources share platform can not only help students to make full use of information technology tools for the realization of personalized learning, but also can strengthen the learning interests and enthusiasms of the students.}, keywords = {Campus Network, Sharing Platform, Teaching Resources}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855387451\&partnerID=40\&md5=689dd41b71fa90672a3a7e7a46026765}, author = {Tian, W.} } @article {209, title = {Case studies on context-aware mobile multimedia services}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):3Export Date: 10 July 2014}, month = {2010}, pages = {4 - 15}, abstract = {This paper explores the design, implementation and evaluation of context-aware mobile multimedia services by presenting six case studies on different application domains. The case studies highlight the opportunities that mobile devices equipped with wireless data transmission provide for contextaware and ubiquitous computing. Special emphasis is placed on empirical evaluation of the services in the field in form of a user evaluation with genuine end users in real environment of use. The paper concludes with a discussion on some important lessons learned from the case studies.}, keywords = {Context-aware system, GPRS network, Mobile advertising, Mobile multimedia, SmartRotuaari, WLAN}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77958049730\&partnerID=40\&md5=d237bec84fe18702a28d433ba8d5ce47}, author = {Ojala, T.} } @article {218, title = {Cellular DBMS: An attempt towards biologically-inspired data management}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2010}, pages = {117 - 128}, abstract = {Existing database management systems (DBMS) are complex and less predictable (i.e., the consistency of performance with the increase of functionality and the data growth is not certain). Database researchers acknowledge the need for revisiting DBMS architectures to fulfill the needs of new hardware and application trends. We propose a biologically inspired DBMS architecture called "Cellular DBMS". The Cellular DBMS architecture promises development of highly customizable and autonomous DBMS. This paper explains in detail the design principles for Cellular DBMS architecture. It also explains an aspect-oriented programming based model to equip Cellular DBMS architecture with autonomy. Finally, it presents an extension to decomposed storage model (DSM) for use in Cellular DBMS.}, keywords = {Adaptability, Biological-inspiration, Customization, Data management, DBMS architectures, Embedded databases}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79952576380\&partnerID=40\&md5=ec9e6d57f05cbabf1fcc0934eb815963}, author = {Ur Rahman, S.S. and K{\"o}ppen, V. and Saake, G.} } @article {212, title = {Content-based image retrieval systems-reviewing and benchmarking}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2010}, pages = {54 - 64}, abstract = {The last detailed review of Content-based Image Retrieval Systems (CBIRS) is that from Veltkamp and Tanase [VT02], updated in 2002. Since then, many new systems emerged, other systems were improved, but many systems are no longer supported. This paper reconsiders the systems described by Veltkamp and Tanase and proposes in addition for a selection of existing CBIRS a quantitative comparison. For this purpose we developed a benchmarking system for CBIRS based on how accurate they could match ideal (ground truth) results. As measure we introduced the RankWRN , which we developed based on the Normalized Avarage Rank. Our measure allows fair and accurate comparisons (due to multiple similarity values) of different CBIRS with respect to different queries. None of the other benchmarks allow this comparison. The choice for a system to be compared quantitatively was motivated by availability of the source or runtime code and the liveness (i.e., active development on the CBIRS). The benchmarked systems were SIMBA, SIMPLIcity, PictureFinder, ImageFinder, Caliph\&, VIPER/GIFT and Oracle Intermedia. Results show that VIPER/GIFT performs best in the settings of our benchmark, Caliph\& is second and SIMBA third. The default parameter settings of the systems tend to show the best results. MPEG-7 descriptors, which are used in Caliph\&, show a good performance in the benchmarking.}, keywords = {Image ranking, MPEG-7 descriptors}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77958035095\&partnerID=40\&md5=3332d95bebdc7fdabeda9f57902ea608}, author = {Kosch, H. and Maier, P.} } @article {180, title = {Cache Pre-fetching and Replacement strategies for location dependent data in mobile environments}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {185 - 190}, abstract = {In this paper, new strategies for prefetching and cache replacement are proposed. The proposed pre-fetching algorithm considers the geographical and semantic adjacency between queried items. The strategy is to pre-fetch the most probable secondary service as a by-product of the execution of a query to a primary service. Association rule mining is used for determining the secondary item that should be pre-fetched. The latter part of the paper deals with a cache replacement algorithm PAID+ (Probability Area Inverse Distance +) which takes into account the access probability and distance between the mobile client and the service item which suits a pre-fetching environment. The experimental evaluations using synthetic datasets show the cache pre-fetch and replacement policy PAID+ are effective in improving the system performance in terms of the cache hit ratio of mobile clients.}, keywords = {Cache replacement, Location dependent data, Prefetching algorithm}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-73249124769\&partnerID=40\&md5=c2445ecd7a2b48db9d0be250bd2dc45e}, author = {Mary Magdalene Jane, F. and Ilayaraja, N. and Nadarajan, R.} } @article {189, title = {CUDL language semantics: Conditions}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {244 - 251}, abstract = {Conceptual Universal Database Language (CUDL) is a new language designed to manage dynamic database environments, which conform to the Frame DataBase model (FDB). FDB is a generic database model (oversubscribe both the Entity-Attribute-Value and the Nested Relational). CUDL is not only an FDB database language but it is mainly an agent that provides an abstraction level superior to the logical level. CUDL permits the users to conceive a database schema where single fields (tags) accept repetitions (list of values), entertain subfields and also permit to entertain an entire table in the place of a single field. In this paper we investigate the conditions, used in both retrieval and update CUDL statements, and focalize especially on the range of affection of the update statements. This becomes necessary since the CUDL abstraction level reveals the differentiation between frame objects, tag repetitions and subfield repetitions and consequently the update statements should clearly define where the data modifications occur. This need becomes heavier where some frame object verifies two (or more) disjunctive conditions and these conditions specify different range of affection inside the frame. We provide two solutions where the second one is an improvement of the first one but it demands more refined statements and more instructed / skilled users. Some constructive discussion is also provided.}, keywords = {Conditions, Database languages, Dynamically evolving database environments}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77953258890\&partnerID=40\&md5=6ee88af2dfa44c5427dc14e26dbc6d40}, author = {Karanikolas, N.N.} } @article {121, title = {Citation auctions as a method to improve selection of scientific papers}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Export Date: 10 July 2014}, month = {2008}, pages = {414 - 420}, abstract = {This paper describes the basis of citation auctions that are introduced as a new approach to selecting scientific papers for publication. Unlike the state of the art in paper selection that relies on peer reviews, our main idea is to use an auction in which bids consist of the number of citations that an author expects to receive if the paper is published. Hence, a citation auction is the selection process itself, and no reviewers are involved. The benefits of the proposed approach are two-fold. First, the cost of refereeing will be either totally eliminated or significantly reduced, because the process of citation auction does not need prior understanding of the paper{\textquoteright}s content to judge the quality of its contribution. Additionally, the method does not prejudge the content of the paper, so it will increase the openness of publications to new ideas. Second, scientists will be much more committed to the quality of their submitted papers, paying close attention to distributing and explaining their papers in detail to maximize the number of citations that the paper receives when published. Sample analyses of the number of citations collected via Google scholar for papers published in years 1999-2004 in a series of proceedings, and in years 2003-2005 in a series of conferences (in a totally different discipline) are provided. Finally, a simple simulation of an auction is given to outline the behaviour of the citation auction approach.}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84865494320\&partnerID=40\&md5=ebc2cdcc8ee9804c72cf125c9ee6c619}, author = {De La Rosa, J.L. and Szymanski, B.K.} } @article {153, title = {Classification of digital libraries - An e-business model-based approach}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2008}, pages = {71 - 80}, abstract = {The impact of digital libraries on information processes steadily increases. Today, users may choose from a rapidly increasing number of digital libraries with various characteristics. Business models for digital libraries evolve from mere content providers to sophisticated service suppliers They offer a rich variety of information services combined with collaboration, e-learning and portal features. Traditional classification schemes for digital libraries do not sufficiently take this development into account or fail to meet it at all. In this paper we present a novel approach to the classification of digital libraries. It is based on business model characteristics with special emphasis on the evolution of digital libraries from content to information service providers. Our classification approach helps suppliers to communicate benefits and features of their libraries more effectively. It also supports customers when selecting an appropriate digital library.}, keywords = {Digital libraries, Digital libraries evaluation, Information processing}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-56849121020\&partnerID=40\&md5=5183b0da70e4e961e3e8e1e49f3af703}, author = {Markscheffel, B. and Fischer, D. and Stelzer, D.} } @article {120, title = {Classification of geographic web services for building an efficient geographic information system offering profitable value added services}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Export Date: 10 July 2014}, month = {2008}, pages = {396 - 404}, abstract = {In this paper we present best practices in implementing a geographic information system that may be used as a foundation for commercial geographic web services. On one hand we explain important rules to be followed during the design of the information system itself, e.g. the data supplyment process. On the other hand we introduce different categories for potential geographic web services and analyze these categories according to several properties. From some of those properties rules can be extracted on how well every kind of service is suited for commercial use and which technical context (e.g. security) has to be observed to be able to offer it. The whole article is based on a case study and prototype where we implemented a geographic database and geographic web services from each of the different categories in the domain of hydrology.}, keywords = {Case study, Commercial web service, Geo web service, Geographic services, GIS, Hydrology, Web service}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84865525965\&partnerID=40\&md5=11ac40933f4282aacc48cbc4550b85c4}, author = {Kleiner, C. and Aliste, A.G.} } @article {162, title = {Cluster based mixed coding schemes for inverted file index compression}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Export Date: 10 July 2014}, month = {2008}, pages = {30 - 37}, abstract = {The cluster property of document collections in today{\textquoteright}s search engines provides valuable information for index compression. By clustering d-gaps of an inverted list based on a threshold, and then encoding clustered and non-clustered d-gaps using different methods, we can tailor to the specific properties of different d-gaps and achieve better compression ratio. Based on this idea, in this paper we propose a cluster based approach and presents two new codes for inverted file index compression: mixed gamma/flat binary code and mixed delta/flat binary code, Experiment results show that the two new codes achieve better or equal performance in terms of compression ratio comparing to interpolative code which is considered as the most efficient bitwise code at present Besides, the two new codes have much lower complexity comparing to interpolative code and therefore enable faster encoding and decoding. By adjusting the parameters for the mixed codes, even better results may be achieved. Experiments show promising results with our approaches.}, keywords = {d-gap, Index compression, Inverted file, Inverted list}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-56849117299\&partnerID=40\&md5=e6f756f0e7e96db7d5c31eadd73799d6}, author = {Chen, J. and Zhong, P. and Cook, T.} } @article {144, title = {Commius - An email based interoperability solution tailored for SMEs}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):5Export Date: 10 July 2014}, month = {2008}, pages = {430 - 433}, abstract = {More than 99\% of European enterprises are SMEs (Small and Medium-sized Enterprises). While in the current market situation collaboration is evolving to an indispensable key factor of success, research is yet to produce results which can be used by SMEs. This paper introduces an interoperability approach in the context of the European Commius Project which enables SMEs collaborate easily on the level of process interoperability. The Commius solution will dock onto existing E-Mail structures and enrich incoming E-Mails with additional information dependant upon its content and provide recommendations of expedient further steps to process the E-Mail. A first picture of the Commius process interoperability layer architecture will be drawn. Furthermore proposals to adapt Commius to the specific processes every SME has, in a simple way, are being exposed.}, keywords = {Business process, Collaboration, Email, Interoperability, SME}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70449333910\&partnerID=40\&md5=5e75b584683eae1a1025309705abc10f}, author = {Burkhart, T. and Werth, D. and Loos, P.} } @article {163, title = {Complex query processing on Web graph: A social network perspective}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2008}, pages = {12 - 20}, abstract = {A social network represents a social community as a directed graph. Communication on the Web has given rise to social network formation like, Web Community, Referral System etc. An earlier effort has proposed a data model for such Web-based social network. Present paper discusses the relevant index structures for processing queries on a social network schema based upon the proposed data model. The paper has also provided evaluation of the structural operators proposed in the data model and discussed their efficacy with query examples.}, keywords = {Operator Evaluation, Query processing, Social Network, Web Graph, XB-tree}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-56849104350\&partnerID=40\&md5=3a2ecc369cf5c3b535859eeb8d73c2e0}, author = {Mitra, S. and Bagchi, A. and Bandyopadhyay, A.K.} } @article {135, title = {Co-training for search-based automatic image annotation}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2008}, pages = {214 - 218}, abstract = {Search-based automatic image annotation is an effective technology to enhance the performance of annotation. By integrating the co-training technique, this paper addresses on a novel scheme for search-based image annotation, in which two classifiers can contribute to each other during the training phase. Since each classifier can select some most confident images to enhance the generalization ability of the other one, the co-training learning algorithm is triggered out for automatically mining more and more relevant images, which improve the annotation performance greatly. To characterize the various contribution of each relevant image, the probability output of the classification is taken as the corresponding weight. Moreover, the histogram of retrieved keywords is proposed to re-rank the final reliability of the keywords to be annotated, which can also guarantee the scalability property of annotation to some extent. With the promoted search precision on the basis of co-training strategy, the experimental results demonstrate the improvement of annotation performance.}, keywords = {Automatic image annotation, Bayesian classifier, Co-training, SVM}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-72449186106\&partnerID=40\&md5=73219b4c7b5383b4a06f69f6ba3903d1}, author = {Zhao, Y. and Zhao, Y. and Zhu, Z.} } @article {113, title = {Clustering frequent graph patterns}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {335 - 346}, abstract = {In recent years, graph mining has attracted much attention in the data mining community. Several efficient frequent subgraph mining algorithms have been recently proposed. However, the number of frequent graph patterns generated by these graph mining algorithms may be too large to be effectively explored by users, especially when the support threshold is low. In this paper, we propose to summarize frequent graph patterns by a much smaller number of representative graph patterns. Several novel concepts such as δ-cover graph, jump value and δ-jump pattern are proposed for efficiently summarizing frequent graph patterns. Based on the property of all δ-jump patterns being representative graph patterns, we propose two efficient algorithms for summarizing frequent graph patterns, RP-FP and RP-GD. The RP-FP algorithm computes representative graph patterns from a set of closed frequent graph patterns, whereas the RP-GD algorithm directly mines representative graph patterns from graph databases. The RP-FP has tight approximation (summarization) bound but higher computational complexity. The RP-GD has no approximation bound guarantee but is far more efficient. We conducted extensive experimental studies using various real and synthetic datasels. Experimental results show that RP-FP and RP-GD are able to obtain compact summarization in both real and synthetic graph databases. When the number of closed graph patterns is very large, RP-GD is much more efficient than RP-FP, while achieving comparable summarization quality.}, keywords = {Closed graph pattern, Frequent graph pattern, Graph mining, Representative graph pattern, δ-jump pattern}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-49149118250\&partnerID=40\&md5=cae15cbd3bb5b1a9e3f57a95dbe295b5}, author = {Liu, Y. and Li, J. and Zhu, J. and Gao, H.} } @article {98, title = {A comparative study on key phrase extraction methods in automatic Web Site Summarization}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):5Export Date: 10 July 2014}, month = {2007}, pages = {323 - 332}, abstract = {Web Site Summarization is the process of automatically generating a concise and informative summary for a given Web site. It has gained more and more attention in recent years as effective summarization could lead to enhanced Web information retrieval systems such as searching for Web sites. Extraction-based approaches to Web site summarization rely on the extraction of the most significant sentences from the target Web site based on the density of a list of key phrases that best describe the entire Web site. In this work, we benchmark five alternative key phrase extraction methods, TFIDF, KEA, Keyword, Keyterm, and Mixture, in an automatic Web site summarization framework we previously developed. We investigate the performance of these underlying methods via a formal user study and demonstrate that Keyterm is the best choice for key phrase extraction while Mixture should be used to obtain key sentences. We also discuss why one method performs better than another and what could be done to further improve the summarization system.}, keywords = {Key phrase extraction, Web retrieval, Web site study}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350686085\&partnerID=40\&md5=1e62cb16df24be6167a1dbde14d4281c}, author = {Zhang, Y. and Milios, E. and Zincir-Heywood, N.} } @article {77, title = {Contextualizing multimedia semantics towards personalised eLearning}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {62 - 67}, abstract = {Recent developments of the Internet and the World Wide Web (WWW) have resulted in the proliferation of multi-media, resources and learning with existing multimedia web resources on the Web is becoming more prevalent and important. While recent standardization efforts in eLearning such as LOM, SCORM, and IMS Learning Design work towards learning content description, packaging, and delivery; existing eLearning solutions still lack the ability to adequately use multi-media resources to provide a learner with personalised learning resources. Effective use of multimedia for web-based learning provides quality interactive learning experience, but current techniques does not adequately provide a semantic approach for organising multimedia resources. With evolving trend in learning through the use of web technology, eLearning systems are expected to provide personalised learning resources for effective learning. We have accordingly proposed a way of organising existing multimedia resources based on contexts towards providing a truly personalised eLearning experience. This paper presents a framework for achieving context-based multimedia semantic annotation and organisation towards personalised learning.}, keywords = {Multimedia technology, Web based learning, WWW}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44849139810\&partnerID=40\&md5=bef7d9f2dbe792bb21840530e2dbb14d}, author = {Eze, E. and Ishaya, T. and Wood, D.M.} } @article {27, title = {Continuously evaluating approximate similarity search on high dimensional data stream}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {82 - 86}, abstract = {In many applications, including online video monitoring system, it is often necessary to find out the most similar sequence, from a sequence set in database, for the high dimensional data stream. Due to its high computation complexity and the restrictions of query processing on data stream, continuously retrieving the similar content on high dimensional data stream is very challenging. The evaluating algorithm is expected to be very fast to match data stream arrival rate. To address this problem, we propose a method called CVNN in this paper. In our method, the sequences in database are represented into the compact summaries, namely CVs, which can be stored in memory. An online algorithm is conducted to transform data stream into a small number of CVs continuously, at the same time the nearest neighbor query is processed periodically based on the similarity of CVs. Experimental results show that our method is fairly effective.}, keywords = {Data stream, High dimensional space, Query processing, Similarity Search, Video indexing}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33748267270\&partnerID=40\&md5=da6323dddf161caf008918184cbec115}, author = {Wang, W. and Li, J. and Ai, C. and Shi, S.} } @article {23, title = {Creating dependable web services using user-transparent replica}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2006}, pages = {16 - 21}, abstract = {Dependability is a major concern in software development, deployment, and operation. A commonly accepted solution for providing fault tolerant services on the Internet is to create replica of the services and to deploy them to several hosts. Whenever the service or the underlying node or network fails, another service is ready to take over. In the Venice project, several techniques are combined to create a dependable framework for deploying and managing distributed services using replica on several distinct network nodes.}, keywords = {Dependable web services, Software development, Venice framework, Web service technology, XML}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33748249857\&partnerID=40\&md5=2f82439b41c666055dd9bd6d4a3dea11}, author = {Hillenbrand, M. and G{\"o}tze, J. and M{\"u}ller, P.} }