• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.775-779
• /
• 2002

Currently, high-resolution satellite imagery such as KOMPSAT and IKONOS has been tentatively utilized to various types of urban engineering problems such as transportation planning, site planning, and utility management. This approach aims at software development and followed applications of remotely sensed imagery to transportation geographic analysis. At first, GDPA (Gradient Direction Profile Algorithm) and main modules in it are overviewed, and newly implemented results under MS visual programming environment are presented with main user interface, input imagery processing, and internal processing steps. Using this software, road network are automatically generated. Furthermore, this road network is used to transportation geographic analysis such as gamma index and road pattern estimation. While, this result, being produced to do-facto format of ESRI-shapefile, is used to several types of road layers to urban/transportation planning problems. In this study, road network using KOMPSAT EOC imagery and IKONOS imagery are directly compared to multiple road layers with NGI digital map with geo-coordinates, as ground truth; furthermore, accuracy evaluation is also carried out through method of computation of commission and omission error at some target area. Conclusively, the results processed in this study is thought to be one of useful cases for further researches and local government application regarding transportation geographic analysis using remotely sensed data sets.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.2
• /
• pp.377-388
• /
• 2019

The system proposed in this paper was suggested as a big data system that works in the age of artificial intelligence of the 4th Industrial Revolution. The proposed system can be a good example in terms of government 's development of new intelligent big data information system. For example, the proposed system may be introduced into the system of a department as a function of the integration of existing cinema ticket integration network or its networking. For this purpose, the proposed system transmits the user's profile to the film producer or other company, where it is provided as comparison data. Soon, the information is sent to the user-specific characteristic data and then the film-maker will be able to gauge the success of the three elements of the movie's performance, cinematic quality, and break-even point in real time, which are revealed through the movie review that the actual user feels, including the so-called 'new reinterpretation.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.05b
• /
• pp.787-790
• /
• 2003

전통적인 원격 평가 시스템들은 학생 개개인의 특성과 성향을 고려하지 않기 때문에 단순하고 획일적이라는 문제점을 갖고 있다. 돈 논문에서는 이러한 문제점을 해결하고 비디오를 통한 평가를 위하여 장면전환검출과 사용자 프로파일을 이용한 원격 비디오 평가 시스템을 제안하고 구현한다 비디오 문제 출제를 위한 장면 전환 검출을 통하여 키 프레임과 문제 출제 구간을 추출한다. 문제 출제 방법은 평가에 사용자 프로파일의 적용을 위하여 카테고리 기반 시스템과 키워드 기반 시스템을 합성한 방법을 이용하였다. 이 시스템을 통하여 학생들은 자신의 부족한 영역을 보충하고 관심 영역을 유지할 수 있으며 학업 성취도를 향상시킬 수 있다 사용자 프로파일을 이용한 본 시스템은 사용자의 문제 풀이 결과에 따라 영역별 문제 수를 조절하고 평가의 질과 효율성을 최대화시킨다.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.8 no.3
• /
• pp.175-184
• /
• 2008

To construct user profiles automatically, an extraction method for representative keywords from a set of documents is needed. In our previous works, we suggested such a method and showed its usefulness. Here, we apply it to the classification problem and observe how much it contributes to performance improvement. The method can be used as a linear document classifier with few modifications. So, we first evaluate its performance for that case. The method is also applicable to some non-linear classification methods such as GIS (Generalized Instance Set). In GIS algorithm, generalized instances are built from training documents by a generalization function and then the K-NN algorithm is applied to them, where the method can be used as a generalization function. For comparative works, two famous linear classification methods, Rocchio and Widrow-Hoff algorithms, are also used. Experimental results show that our method is better than the others for the case that only positive documents are considered, but not when negative documents are considered together.

• International Journal of Computer Science & Network Security
• /
• v.24 no.9
• /
• pp.150-156
• /
• 2024

With the advent of personalized search engines, a myriad of approaches came into practice. With social media emergence the personalization was extended to different level. The main reason for this preference of personalized engine over traditional search was need of accurate and precise results. Due to paucity of time and patience users didn't want to surf several pages to find the result that suits them most. Personalized search engines could solve this problem effectively by understanding user through profiles and histories and thus diminishing uncertainty and ambiguity. But since several layers of personalization were added to basic search, the response time and resource requirement (for profile storage) increased manifold. So it's time to focus on optimizing the layered architectures of personalization. The paper presents a layout of the multi agent based personalized search engine that works on histories and profiles. Further to store the huge amount of data, distributed database is used at its core, so high availability, scaling, and geographic distribution are built in and easy to use. Initially results are retrieved using traditional search engine, after applying layer of personalization the results are provided to user. MongoDB is used to store profiles in flexible form thus improving the performance of the engine. Further Weighted Sum model is used to rank the pages in personalization layer.

• Journal of Internet Computing and Services
• /
• v.21 no.4
• /
• pp.87-95
• /
• 2020

The Science and Technology Information Service provided by the Korea Institute of Science and Technology Information (KISTI) is a service designed to allow users to easily and conveniently search and view content that is built similar to the general information service. NDSL is KISTI's core science, technology and information service, providing about 138 million content and having about 93 million page views in a year of 2019. In this paper, various insights were derived through the analysis of how science and technology information such as academic papers, reports and patents provided by NDSL is searched and utilized through web services (https://www.ndsl.kr) and search query words. In addition to general statistics such as the status of content construction, utilization status and utilization methods by type of content, monthly/weekly/time-of-day content usage, content view rate per one-time search by content type, the comparison of the use status of academic papers by year, the relationship between the utilization of domestic academic papers and the KCI index we analyzed the usability of each content type, such as academic papers and patents. We analyzed query words such as the language form of query words, the number of words of query words, and the relationship between query words and timeliness by content type. Based on the results of these analyses, we would like to propose ways to improve the service. We suggest that NDSL improvements include ways to dynamically reflect the results of content utilization behavior in the search results rankings, to extend query and to establish profile information through non-login user identification for targeted services.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.4
• /
• pp.488-493
• /
• 2007

In general, recommendation systems quantify real-time context information obtained in the stage of collaborative filtering and use quantified context information in order to recommend services. But the recommendation systems can have problems of recommending inaccurate information because of lack of context information or classifying users into inaccurate groups because of simple classification works in the stage of quantification. In this paper, we solved the problems of lack of context information obtained in real-time by combining users' profile information used in the contents-based filtering and context information obtained in real-time. In addition, we tried collaborative filtering at the quantification stage by improving absolute classification methods to relative ones. As the result of experiments, this method improved prediction preference by 5.8% than real-time recommendation systems using context information in pure P2P environment.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.2
• /
• pp.69-76
• /
• 2012

This paper proposes a novel way of personalized web search through re-ranking the search results with user profiles of concept-network structure. Basically, personalized search systems need to be based on user profiles that contain users' search patterns, and they actively use the user profiles in order to expand initial queries or to re-rank the search results. The proposed method is a sort of a re-ranking personalized search method integrated with query expansion facility. The method identifies some documents which occur commonly among a set of different search results from the expanded queries, and re-ranks the search results by the degree of co-occurring. We show that the proposed method outperforms the conventional ones by performing the empirical web search with a number of actual users who have diverse information needs and query intents.

• The Journal of Korean Association of Computer Education
• /
• v.13 no.1
• /
• pp.45-52
• /
• 2010

With rapid increase in the number of web documents, the problem of information overload in Internet search is growing seriously. In order to improve web search results, previous research studies employed user queries/preferred words and the number of links in the web documents. In this study, performance of the search results exploiting these two criteria is examined and other preference criteria for web documents are analyzed. Experimental results show that personalized web search results employing queries and preferred words yield up to 1.7 times better performance over the current search engine and that the search results using the number of links gives up to 1.3 times better performance. Although it is found that the first of the user's preference criteria for web documents is the contents of the document, readability and images in the document are also given a large weight. Therefore, performance of web search personalization algorithms will be greatly improved if they incorporate objective data reflecting each user's characteristics in addition to the number of queries and preferred words.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.6
• /
• pp.1265-1270
• /
• 2011

Different wireless technologies have been developed for various mobile applications. To offer seamless service in next mobile communication systems, it needs handoff service between heterogeneous mobile access networks. A high data rate handoff call from WLAN to cellular mobile network can increase rapidly the blocking probability of BS of cellular mobile network. To solve this problem, this paper proposes a new handoff scheme based on user service profiles. The performances of the proposed scheme are evaluated using computer simulations.