Author image not provided
 Md Hanif Seddiqui

Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article5.25
Citation Count42
Publication count8
Publication years2008-2015
Available for download2
Average downloads per article134.50
Downloads (cumulative)269
Downloads (12 Months)29
Downloads (6 Weeks)5
Arrow RightAuthor only

See all colleagues of this author

See all subject areas


8 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 8 of 8
Sort by:

1 published by ACM
July 2015 ACM Transactions on Intelligent Systems and Technology (TIST) - Regular Papers and Special Section on Intelligent Healthcare Informatics: Volume 6 Issue 4, August 2015
Publisher: ACM
Citation Count: 0
Downloads (6 Weeks): 5,   Downloads (12 Months): 26,   Downloads (Overall): 139

Full text available: PDFPDF
With vast amounts of medical knowledge available on the Internet, it is becoming increasingly practical to help doctors in clinical diagnostics by suggesting plausible diseases predicted by applying data and text mining technologies. Recently, Genome-Wide Association Studies ( GWAS ) have proved useful as a method for exploring phenotypic associations ...
Keywords: NDCG, Bipartite, BM25, Genotype, Phenotype

March 2010 ACE'10: Proceedings of the 9th WSEAS international conference on Applications of computer engineering
Publisher: World Scientific and Engineering Academy and Society (WSEAS)
Citation Count: 1

The proliferation of heterogeneous sources of instances raises a research issue of achieving interoperability through instance matching. In this paper, we propose an efficient algorithm for ontology instance matching by considering the semantic links associated to a particular instance. An instance is specified explicitly with the help of linked concepts, ...
Keywords: identity recognition, ontology knowledge base, semantic link cloud, instance matching, ontology alignment, record linkage

February 2010 AIKED'10: Proceedings of the 9th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases
Publisher: World Scientific and Engineering Academy and Society (WSEAS)
Citation Count: 0

The rapid growth of heterogeneous sources of massive ontology instances raises a scalability issue in ontology instance matching of semantic knowledge bases. In this paper, we propose an efficient method of instance matching by considering secondary classification of monotonic large instances to achieve scalability. We use a taxonomy of the ...
Keywords: classification, ontology instance matching, semantic knowledge base

January 2010 APCCM '10: Proceedings of the Seventh Asia-Pacific Conference on Conceptual Modelling - Volume 110
Publisher: Australian Computer Society, Inc.
Citation Count: 3
Downloads (6 Weeks): 0,   Downloads (12 Months): 3,   Downloads (Overall): 130

Full text available: PDFPDF
Measuring information content (IC) from the intrinsic information of an ontology is an important however a formidable task. IC is useful for further measurement of the semantic similarity. Although the state-of-art metrics measure IC, they deal with external knowledge base or intrinsic hyponymy relations only. A current complex form of ...
Keywords: concept, semantic similarity, ontology, information content

December 2009 Web Semantics: Science, Services and Agents on the World Wide Web: Volume 7 Issue 4, December, 2009
Publisher: Elsevier Science Publishers B. V.
Citation Count: 29

It has been a formidable task to achieve efficiency and scalability for the alignment between two massive, conceptually similar ontologies. Here we assume, an ontology is typically given in RDF (Resource Description Framework) or OWL (Web Ontology Language) and can be represented by a directed graph. A straightforward approach to ...
Keywords: Ontology alignment, Locality of reference, Segmented alignment

October 2009 OM'09: Proceedings of the 4th International Conference on Ontology Matching - Volume 551
Citation Count: 6

Our ontology schema matching algorithm takes the essence of the locality of reference by considering the neighboring concepts and relations to align the entities of ontologies. It starts off a seed point called an anchor (a pair of "look-alike" concepts across ontologies) and collects two blocks of neighboring concepts across ...

September 2009 ICSC '09: Proceedings of the 2009 IEEE International Conference on Semantic Computing
Publisher: IEEE Computer Society
Citation Count: 2

Integration of heterogeneous information and acquisition of diverse knowledge from independent media is getting researchers’ attention at a rapid pace. Heterogeneous contents turn out to become sharable objects. In this connection, MPEG-7 standard evolves for containing structured data and knowledge source. The content is described by structured XML data, which ...

October 2008 OM'08: Proceedings of the 3rd International Conference on Ontology Matching - Volume 431
Citation Count: 1

Our proposed algorithm called Anchor-Flood algorithm, starts off with anchors. It gradually explores concepts by collecting neighbors in concept taxonomy, thereby taking advantage of locality of reference in the graph data structure. Then local alignment process runs over the collected small blocks of concepts. The process is repeated for the ...

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us