Research ArticleOpen accessIn the abstractSemSimp: A Parametric Method for Evaluating the Semantic Similarity of Digital ResourcesAntonio De Nicola, Anna Formica, Ida Mele, Francesco TaglinoAbioui, H., Idarrou, A., Bouzit, A., & Mammass, D. (2018). Towards a Novel and Generic Approach for OWL Ontology Weighting. Procedia Computer Science, 127, 426–435. https://doi.org/10.1016/j.procs.2018.01.140 Adhikari, A., Dutta, B., Dutta, A., Mondal, D., & Singh, S. (2018). An intrinsic information content-based semantic similarity measure considering the disjoint common subsumers of concepts of an ontology. Journal of the Association for … …Journal of Computer Science, Vol. 20, Issue 8 · 27 May 2024 · 5,773 accessesView PDFCite
Research ArticleOpen accessIn the abstractAccelerating Digital Forensics through Parallel ComputingGhada Elkabbany, Mohamed Rasslan, Heba AslanDigital crimes in the era of big data and cloud computing imposes significant challenges in digital forensics. Cloud environment provides low cost, easy management and reasonable solutions. Moreover, it supports big data structures and solutions (i.e., security, privacy and digital forensics). In order to achieve a secure digital forensics analysis in cloud environment, researchers have proposed solutions with expensive communication … …Journal of Computer Science, Vol. 14, Issue 2 · 20 Feb 2018 · 8,035 accessesView PDFCite
Research ArticleOpen accessIn the abstractUsing Hyper Clustering Algorithms in Mobile Network PlanningLamiaa Fattouh Ibrahim, Hesham A. SalmanProblem statement: As a large amount of data stored in spatial databases, people may like to find groups of data which share similar features. Thus cluster analysis becomes an important area of research in data mining. Applications of clustering analysis have been utilized in many fields, such as when we search to construct a cluster served by base station in … …American Journal of Applied Sciences, Vol. 8, Issue 10 · 30 Aug 2011 · 7,504 accessesView PDFCite
Research ArticleOpen accessIn the abstractUsing Unique-Prime-Factorization Theorem to Mine Frequent Patterns without Generating TreeHossein Tohidi, Hamidah IbrahimProblem statement: Ffrequent patterns are patterns that appear in a data set frequently. Finding such frequent patterns plays an essential role in mining associations, correlations and many other interesting relationships among data. Approach: Most of the previous studies adopt an Apriorilike approach. For huge database it may need to generate a huge number of candidate sets. An interest solution is … …American Journal of Economics and Business Administration, Vol. 3, Issue 1 · 7 Jan 2011 · 8,839 accessesView PDFCite
Research ArticleOpen accessIn the abstractOn Recipe Based Service Composition in Ubiquitous Smart SpacesJunaid A. Chowdary, Seung-Kyu Park, Suk-Kyo HongWe present a recipe based service composition scheme in smart spaces. We discuss real time problems of highly synchronized and user customizable processes with the help of an example. On-the-fly Quality of Service (QoS) shows up as a major issue in such environment. Furthermore the QoS of a dynamically composed service depends upon the aggregate QoS of its developing components. … …Journal of Computer Science, Vol. 2, Issue 1 · 31 Jan 2006 · 6,760 accessesView PDFCite