Patent documents are unique external sources of information that reveal the core technology underlying new inventions. Patents also serve as a strategic data source that can be mined to discover state-of-the-art technical development and subsequently help guide R&D investments. This research incorporates an ontology schema to extract and represent patent concepts. A clustering algorithm with non-exhaustive overlaps is proposed to overcome deficiencies with exhaustive clustering methods used in patent mining and technology discovery. The non-exhaustive clustering approach allows for the clustering of patent documents with overlapping technical findings and claims, a feature that enables the grouping of patents that define related key innovations. Legal advisors can use this approach to study potential cases of patent infringement or devise strategies to avoid litigation. The case study demonstrates the use of non-exhaustive overlaps algorithm by clustering US and Japan radio frequency identification (RFID) patents and by analyzing the legal implications of automated discovery of patent infringement.

Engineering and research teams often develop new products and technologies by referring to inventions described in patent databases. Efficient patent analysis builds R&D knowledge, reduces new product development time, increases market success, and reduces potential patent infringement.Thus, it is beneficial to automatically and systematically extract information from patent documents in order to improve knowledge sharing and collaboration among R&D team members. In this research, patents are summarized using a combined ontology based and TF-IDF concept clustering approach.The ontology captures the general knowledge and core meaning of patents in a given domain. Then, the proposed methodology extracts, clusters, and integrates the content of a patent to derive a summary and a cluster tree diagram of key terms. Patents from the International Patent Classification (IPC) codes B25C, B25D, B25F (categories for power hand tools) and B24B, C09G and H011 (categories for chemical mechanical polishing) are used as case studies to evaluate the compression ratio, retention ratio, and classification accuracy of the summarization results. The evaluation uses statistics to represent the summary generation and its compression ratio, the ontology based keyword extraction retention ratio, and the summary classification accuracy. The results show that the ontology based approach yields about the same compression ratio as previous non-ontology based research but yields on average an 11% improvement for the retention ratio and a 14% improvement for classification accuracy.

This paper presents a cluster head selection algorithm in wireless network, which is based on an optimal algorithm to find a maximum weighted independent set (MWIS) in planar graph. It is analysed that the wireless AD hoc networks and the application of the maximum weighted independent set. To prove the validity and practicability of MWIS, we compare MWIS algorithm with minimum ID clustering algorithm and maximum degree clustering algorithm by using a topological subgraph.

No abstract

No abstract