To quickly find documents with high similarity in existing documentation sets, fingerprint group merging retrieval algorithm is proposed to address both sides of the problem:a given similarity threshold could not be t...To quickly find documents with high similarity in existing documentation sets, fingerprint group merging retrieval algorithm is proposed to address both sides of the problem:a given similarity threshold could not be too low and fewer fingerprints could lead to low accuracy. It can be proved that the efficiency of similarity retrieval is improved by fingerprint group merging retrieval algorithm with lower similarity threshold. Experiments with the lower similarity threshold r=0.7 and high fingerprint bits k=400 demonstrate that the CPU time-consuming cost decreases from 1 921 s to 273 s. Theoretical analysis and experimental results verify the effectiveness of this method.展开更多
This paper combines interval-valued intuitionistic fuzzy sets and rough sets.It studies rougheness in interval-valued intuitionistic fuzzy sets and proposes one kind of interval-valued intuitionistic fuzzy-rough sets ...This paper combines interval-valued intuitionistic fuzzy sets and rough sets.It studies rougheness in interval-valued intuitionistic fuzzy sets and proposes one kind of interval-valued intuitionistic fuzzy-rough sets models under the equivalence relation in crisp sets.That extends the classical rough set defined by Pawlak.展开更多
基金Project(60873081) supported by the National Natural Science Foundation of ChinaProject(NCET-10-0787) supported by the Program for New Century Excellent Talents in University, ChinaProject(11JJ1012) supported by the Natural Science Foundation of Hunan Province, China
文摘To quickly find documents with high similarity in existing documentation sets, fingerprint group merging retrieval algorithm is proposed to address both sides of the problem:a given similarity threshold could not be too low and fewer fingerprints could lead to low accuracy. It can be proved that the efficiency of similarity retrieval is improved by fingerprint group merging retrieval algorithm with lower similarity threshold. Experiments with the lower similarity threshold r=0.7 and high fingerprint bits k=400 demonstrate that the CPU time-consuming cost decreases from 1 921 s to 273 s. Theoretical analysis and experimental results verify the effectiveness of this method.
基金supported by grants from the National Natural Science Foundation of China(Nos.10971185 and 10971186)the Natural Science Foundation of Fujiang Province in China(No.2008F5066).
文摘This paper combines interval-valued intuitionistic fuzzy sets and rough sets.It studies rougheness in interval-valued intuitionistic fuzzy sets and proposes one kind of interval-valued intuitionistic fuzzy-rough sets models under the equivalence relation in crisp sets.That extends the classical rough set defined by Pawlak.
