搜索空间引擎在Fuzzy联合聚类中使用FCC_STF算法优化搜索
Search Space Engine Optimize Search Using FCC_STF Algorithm in Fuzzy Co-Clustering
摘要：
模糊联合聚类算法可以通过处理两个主要问题来改进：第一是离群点问题，第二是维数灾难问题，通过搜索引擎在一组网页帧中有效地执行页面置换算法，如FIFO、LRU或优先级算法，可以减少离群点问题。优先级为零的网页（离群值）可以在单独的帧槽中表示。而对搜索引擎获取的网页进行FCC_STF算法，首先减少离群点问题，可以改善维数灾难问题。根据所用模糊化器的不同，比较了FCCM算法和FUZZY CO-DOK算法与FCC_STF算法的优缺点。FCC_STF算法将模糊化器融合为一个实体，通过对（A1，B1，Vcj，A2，B2）值的实验结果表明，该算法对局部极大值不敏感，通过绘制J（fcc_stf）和Vcj之间的关系图，可以获得网页的二维最优搜索空间。
英文摘要：
Fuzzy co-clustering can be improved if we handle two main problem first is outlier and second curse of dimensionality .outlier problem can be reduce by implementing page replacement algorithm like FIFO, LRU or priority algorithm in a set of frame of web pages efficiently through a search engine. The web page which has zero priority (outlier) can be represented in separate slot of frame. Whereas curse of dimensionality problem can be improved by implementing FCC_STF algorithm for web pages obtain by search engine that reduce the outlier problem first. The algorithm FCCM and FUZZY CO-DOK are compared with FCC_STF algorithm with merit and demerits on the bases of different fuzzifier used. FCC_STF algorithm in which fuzzifier fused into one entity who have shown high performance by experiment result of values (A1,B1,Vcj,A2,B2) seem to less sensitive to local maxima and obtain optimization search space in 2-D for web pages by plotting graph between J(fcc_stf) and Vcj.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
