This article introduces the method to assess similarity based on Facebook Graph API and users' movements. All movements of users are collected and analyzed. This paper presents a two-step multiparameter algorithm ...
详细信息
This article introduces the method to assess similarity based on Facebook Graph API and users' movements. All movements of users are collected and analyzed. This paper presents a two-step multiparameter algorithm that generates recommendations based on users' social activity and movements. A flexible mechanism for the calculations of time that one spends on a variety of social activities to more accurately identify the relationships between users is presented. To reduce the load on the application the algorithms of data analysis and transfer optimization are proposed. The ultimate result of the study is to build a platform based on the "client-server" model and includes a mobile app on the iOS platform and server, which would be set up on the "LAMP" platform. The given result can be used and applied in various spheres of our lives to identify different relationships between people.
Era of knowledge economy, how to effectively mining, the use of knowledge is the enterprise growing concern. CBR system from the field of artificial intelligence is a self-learning system to manage tacit knowledge (ca...
详细信息
Era of knowledge economy, how to effectively mining, the use of knowledge is the enterprise growing concern. CBR system from the field of artificial intelligence is a self-learning system to manage tacit knowledge (case). Case retrieval link is the core link, the advantages and disadvantages of search methods directly affect the efficiency of case retrieval and case matching accuracy. Therefore, this paper proposes a new case matching process: when the size of the case database is small, it searches based on the case similarity algorithm; when the case database is large, it searches based on the FCM secondary retrieval model. And illustrates the fastness and efficiency of FCM in matching large-scale case database.
Respecting of the bounded rationality in the process of estimating similarity, the case-based reasoning similarity algorithm based on distance threshold is improved. The improved similarity algorithm is used in the ca...
详细信息
Respecting of the bounded rationality in the process of estimating similarity, the case-based reasoning similarity algorithm based on distance threshold is improved. The improved similarity algorithm is used in the case-based reasoning decision model of product conceptual design. The similarity between new circular gear reducer and finished products is calculated with the decision model. The result validates the improved algorithm can effectively exclude useless cases.
Most of the exist Web search engines utilize matching the query keywords to pieces of information approach to identify of the data satisfying user's request. These methods are not only inefficient, but also wasted...
详细信息
ISBN:
(纸本)9788996865056
Most of the exist Web search engines utilize matching the query keywords to pieces of information approach to identify of the data satisfying user's request. These methods are not only inefficient, but also wasted a lot of user's time to find a satisfactory results. In order to improve the problem above, we presented a different approach to identify user's request that attracts more interest is called a ontology-based and implied sentiment search. Ontology is a tree structure which represent specifications of concepts and relations among them. Ontology play a central role in semantic web applications by providing a shared knowledge about the objects in real world. This paper proposes a method for determining semantic similarity between concepts and implied sentiment defined in ontology. Unlike method exist that use ontological definition of concepts for similarity assessment, the presented approach also focuses on the relations between concepts and their implied sentiment inclination. Our method is able to determine similarity not only at the definition level, but also is able to evaluate similarity of implied sentiment of information that are instances of concepts. In addition, the method allows for context-aware similarity assessment. Experimental comparison of our on-line text mining approach against other techniques known in the literature shows satisfying results.
Purpose: To discuss the problems arising from hierarchical cluster analysis of co-occurrence matrices in SPSS, and the corresponding solutions. Design/methodology/approach: We design different methods of using the S...
详细信息
Purpose: To discuss the problems arising from hierarchical cluster analysis of co-occurrence matrices in SPSS, and the corresponding solutions. Design/methodology/approach: We design different methods of using the SPSS hierarchical clustering module for co-occurrence matrices in order to compare these methods. We offer the correct syntax to deactivate the similarity algorithm for clustering analysis within the hierarchical clustering module of SPSS. Findings: When one inputs co-occurrence matrices into the data editor of the SPSS hierarchical clustering module without deactivating the embedded similarity algorithm, the program calculates similarity twice, and thus distorts and overestimates the degree of similarity. Practical implications: We offer the correct syntax to block the similarity algorithm for clustering analysis in the SPSS hierarchical clustering module in the case of co-occurrence matrices. This syntax enables researchers to avoid obtaining incorrect results. Originality/value: This paper presents a method of editing syntax to prevent the default use of a similarity algorithm for SPSS's hierarchical clustering module. This will help researchers, especially those from China, to properly implement the co-occurrence matrix when using SPSS for hierarchical cluster analysis, in order to provide more scientific and rational results.
Research on similarity methodology of dynamic tracing disciplinary themes based on improved similarity algorithm is the improvement and perfection of current similarity methodology based on coword analysis, and also i...
详细信息
Research on similarity methodology of dynamic tracing disciplinary themes based on improved similarity algorithm is the improvement and perfection of current similarity methodology based on coword analysis, and also is good supplement to the mapping method of dynamic tracing disciplinary themes based on coword analysis. Three algorithms of similarity methodology have common shortcoming that lacking of deeply analyzing the relationship of theme evolution. Aiming at the common flaw and deeply analyzing theme evolution, author has done some improving research based on Coulter's similarity index, and expatiated on the related problems of improved algorithm. Through this research, we can more deeply and imperceptiblly reveal the relationship of theme evolution, and more accurately trace the evolution track of disciplinary theme.
This paper describes a method to the problem of reconstructing regular shredded documents by similarity measure. Regular shredded document can be quantized as gray-level matrix or two-value matrix. So we can match the...
详细信息
This paper describes a method to the problem of reconstructing regular shredded documents by similarity measure. Regular shredded document can be quantized as gray-level matrix or two-value matrix. So we can match the gray value of the edge of the shredded document, which is indicated as similarity value. We calculate the similarity value by using improved minimum-error method, a kind of similarity measure method. The two shredded owning the biggest similarity value is probable to be the neighboring ones. So we can reconstruct these regular shredded documents through this method until it is recovered.
Web data is currently mainly in the form of HTML pages, expressed by the HTML language of Web pages through the browser after analysis is only suitable for people to browse, not suitable for data exchange as a way to ...
详细信息
ISBN:
(纸本)9780769538594
Web data is currently mainly in the form of HTML pages, expressed by the HTML language of Web pages through the browser after analysis is only suitable for people to browse, not suitable for data exchange as a way to deal with by a computer. This article will make web page decompound a DOM tree, then from the DOM tree body root node to start, in accordance with the breadth-first traversal order DOM tree, layer by layer comparison DOM node tree, statistics of its changes, and then the sum of all floors of the changes, If less than a certain threshold, it is structurally similar to two pages, otherwise dissimilar, because this algorithm is only concerned about the page structure information without concern for the content of the page, it has a very high operating efficiency, while the algorithm is not limited to a specific web page, with good versatility.
This paper came up with introducing four dimensions: learning mood, cognitive state, learning style and interest preference and so on for the semantic web, based on the analysis the present situation student models at...
详细信息
This paper came up with introducing four dimensions: learning mood, cognitive state, learning style and interest preference and so on for the semantic web, based on the analysis the present situation student models at home and abroad. Realized to classify learners and establish student models which used an improved similarity algorithm, and the student model applied to adaptive learning system, which not only could solve the lack semantic in adaptive learning system, and greatly improves the practicability, intelligent and personalized.
In the distance education platform, it is an important topic that how to intelligently help learner to find right helperTo address the problem, a set of matching model of problem and helper based on problem similarity...
详细信息
In the distance education platform, it is an important topic that how to intelligently help learner to find right helperTo address the problem, a set of matching model of problem and helper based on problem similarity under mutual learning system environment was presented with multi-agent technologyThe model introduces concept of problem gathering, namely to determine similarity between helper and problem by computing similarity among many problems and proposed problemsBy returning helper agent that has many similarities with proposed problem, the circumstance of non-relevance between matching problem and proposed problem can be avoidedMeanwhile, the concept of valid problem number, valid matching problem number and average similarity of valid matching problem, it can ensure effectively solving problem of helper matchingExperiment results show that the helper matching model can achieve ideal matching effect1Introduction
暂无评论