KMITL

Permanent URI for this communityhttps://dspace.kmitl.ac.th/handle/123456789/1

Browse

Settings

Subject: search.filters.subject.Information retrieval

Search Results

Now showing 1 - 2 of 2
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    An ontology-based case matching technique
    (2007-12-01)
    Tanawong, Tawin
    ;
    Chittayasothorn, Suphamit
    Case-based reasoning is an artificial intelligence technique that refers to past experiences (cases) to help making decisions or taking actions. An important part of case based reasoning is case matching. Previous cases which are similar to a current given case are matched and retrieved. This paper presents a case matching technique that transforms input surface structure sentences into deep-structure sentences which can be represented by fact types of a conceptual schema model. Each entity type that is involved in a fact type is further described by ontology. The matching result of the proposed technique is compared with those of other classical technique. Better similarity of the case matching is found.
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    Extended rough fuzzy sets for web search agent
    (2003-01-01)
    Rojanavasu, Ponthap
    ;
    Pinngern, Ouen
    We propose a new method to create an intelligent Web search agent based on combining rough sets and fuzzy sets. Firstly, we create user profiles which is the important part to approximate query and document. We also design categories of user interests by grouping key terms. We update and create new categories automatically from user feedback. Secondly, we use combined rough and fuzzy sets to refine each query. Each query and document has two parts: a set of core queries and a set of possibly queries. Then we submit a set of queries to WWW search engines. Thirdly, a rough fuzzy set is used to represent each result from WWW search engines. Lastly, we compute a degree of similarity between query and documents for ranking purpose. Using these techniques, we can improve the precision level of the result from WWW search engines that are suitable for individual usage. © 2003 SRCE University Computing Centre.