Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Association Link Network (ALN) is used to establish associated relations among various resources, aiming at extending the hyperlink network World Wide b to an association-rich network, for effectively supporting b intelligence activities. Unfortunately, with the increase number of b resources, the challenge of incremental building of ALN is on how to perform the association ight of the new coming b resources efficiently and exactly. A naive way is to compare every pair of data in the existing ALN, thus bearing a O(n2) time complexity. Given the scale of the b, it is unrealistic to compute the association ight beten the new coming b data and each data in the existing ALN, respectively. , a new method based on All-Pairs algorithm for incremental building of ALN is proposed. The experiments and evaluations show that our incremental building method performs a high accuracy. Moreover, the scale-independent property of our method make it more appropriate to be used on the b.
['Zheng Xu', 'Xiangfeng Luo', 'Wenjun Lu']
I am writing a research paper on a idea Association Link Network: An Incremental Semantic Data Model on Organizing Web Resources
[{"from": "human", "value": "I am writing a research paper on a idea Association Link Network: An Incremental Semantic Data Model on Organizing Web Resources"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Association Link Network (ALN) is used to establish associated relations among various resources, aiming at extending the hyperlink network World Wide b to an association-rich network, for effectively supporting b intelligence activities. Unfortunately, with the increase number of b resources, the challenge of incremental building of ALN is on how to perform the association ight of the new coming b resources efficiently and exactly. A naive way is to compare every pair of data in the existing ALN, thus bearing a O(n2) time complexity. Given the scale of the b, it is unrealistic to compute the association ight beten the new coming b data and each data in the existing ALN, respectively. , a new method based on All-Pairs algorithm for incremental building of ALN is proposed. The experiments and evaluations show that our incremental building method performs a high accuracy. Moreover, the scale-independent property of our method make it more appropriate to be used on the b."}]