• Journal of Information Processing Systems
• /
• 제19권4호
• /
• pp.407-416
• /
• 2023

In order to effectively relieve the traffic pressure of the city, ensure the smooth flow of freight and promote the development of the logistics industry, the selection of appropriate port logistics location is the basis of giving full play to the port logistics function. In order to better realize the selection of port logistics, this paper adopts the entropy weight method to set up a multi-dimensional evaluation index, and constructs the evaluation model of port logistics location. Then through the actual case, from the environmental dimension and economic competition dimension to make choices and analysis. The results show that port d has the largest logistics competitiveness and the highest relative proximity among the three indicators of hinterland city economic activity, hinterland economic structure, and port operation capacity of different port logistics locations, which has absolute advantages. It is hoped that the research results can provide a reference for the multi-dimensional selection of port logistics site selections.

• 복식문화연구
• /
• 제11권2호
• /
• pp.219-230
• /
• 2003

The purpose of this study was to analyze the structure of consumption emotions that consumers experienced in the process of consuming apparel products. Data was collected from 144 female college students living in Busan, and analyzed by salience, diversity, H-index, Clamor's V, and multi-dimensional scaling. The results showed as following; 1. The consumption emotions related to apparel products appeared three dimensions; ‘Relaxed-tense’ dimension, ‘Pleasant-unpleasant’ dimension, and ‘Outward-inward’ dimension. Considering elements of consumption system, the dimensions of consumption emotions in relation to apparel performances were 'Pleasant-unpleasant' and ‘Outward-inward’. The dimensions of consumption emotions experienced in usage situations were ‘Relaxed-tense’ and ‘pleasant-unpleasant’. The consumption emotions related to specific products were composed of ‘Pleasant-unpleasant’ dimension and ‘Outward-inward’ dimension. 2. As the multi-dimension map of this study has much space, it suggested that the scope of consumption emotions related to apparel products was more limited than those related to general situations and products. 3. The structure of consumption emotions in relation to apparel performances appeared to be bisected, while those related to usage situations showed relatively to be dispersed. 4. Although Pleasant-unpleasant dimension was consistent with results of prestudies, the dimensions of ‘Relaxed-tense’ and ‘Outward-inward’ were newly confirmed as the dimensions of consumption emotions related to apparel products. Therefore, consumer's consumption emotions of apparel products were composed of three dimensions, tended to be more limited than those of general consumption situations and products, and differentiated across apparel performances, usage situation, and specific products.

• Journal of Computing Science and Engineering
• /
• 제1권2호
• /
• pp.177-194
• /
• 2007

Index selection is one of the most important decisions to take in the physical design of relational data warehouses. Indices reduce significantly the cost of processing complex OLAP queries, but require storage cost and induce maintenance overhead. Two main types of indices are available: mono-attribute indices (e.g., B-tree, bitmap, hash, etc.) and multi-attribute indices (join indices, bitmap join indices). To optimize star join queries characterized by joins between a large fact table and multiple dimension tables and selections on dimension tables, bitmap join indices are well adapted. They require less storage cost due to their binary representation. However, selecting these indices is a difficult task due to the exponential number of candidate attributes to be indexed. Most of approaches for index selection follow two main steps: (1) pruning the search space (i.e., reducing the number of candidate attributes) and (2) selecting indices using the pruned search space. In this paper, we first propose a data mining driven approach to prune the search space of bitmap join index selection problem. As opposed to an existing our technique that only uses frequency of attributes in queries as a pruning metric, our technique uses not only frequencies, but also other parameters such as the size of dimension tables involved in the indexing process, size of each dimension tuple, and page size on disk. We then define a greedy algorithm to select bitmap join indices that minimize processing cost and verify storage constraint. Finally, in order to evaluate the efficiency of our approach, we compare it with some existing techniques.

• Journal of applied mathematics & informatics
• /
• 제40권1_2호
• /
• pp.289-303
• /
• 2022

This article examines the multidimensional index extraction method of the disability social security system based on data mining. While creating the data warehouse of the social security system for the disabled, we need to know the elements of the social security indicators for the disabled. In this context, a clustering algorithm was used to extract the indicators of the social security system for the disabled by investigating the historical dimension of social security for the disabled. The simulation results show that the index extraction method has high coverage, sensitivity and reliability. In this paper, a multidimensional extraction method is introduced to extract the indicators of the social security system for the disabled based on data mining. The simulation experiments show that the method presented in this paper is more reliable, and the indicators of social security system for the disabled extracted are more effective in practical application.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권2호
• /
• pp.597-618
• /
• 2019

Categorical range aggregation, which is conceptually equivalent to running a range aggregation query separately on multiple datasets, returns the query result on each dataset. The challenge is when the number of dataset is as large as hundreds or thousands, it takes a lot of computation time and I/O. In previous work, only a single dimension of the range restriction has been solved, and in practice, more applications are being used to calculate multiple range restriction statistics. We proposed MCRI-Tree, an index structure designed to solve multi-dimensional categorical range aggregation queries, which can utilize main memory to maximize the efficiency of CRA queries. Specifically, the MCRI-Tree answers any query in $O(nk^{n-1})$ I/Os (where n is the number of dimensions, and k denotes the maximum number of pages covered in one dimension among all the n dimensions during a query). The practical efficiency of our technique is demonstrated with extensive experiments.

• 대한한방내과학회지
• /
• 제45권1호
• /
• pp.1-10
• /
• 2024

Objectives: This study investigated the pattern identification (PI) and clinical index of Parkinson's disease (PD) for personalized diagnosis and treatment. Methods: This prospective observational multi-center study recruited 100 patients diagnosed with PD from two Korean medicine hospitals. To cluster new subtypes of PD, items on a PI questionnaire (heat and cold, deficiency and excess, visceral PI) were evaluated along with pulse and tongue analysis. Gait analysis was performed and blood and feces molecular signature changes were assessed to explore biomarkers for new subtypes. In addition, unified PD rating scale II and III scores and the European quality of life 5-dimension questionnaire were assessed. Results: The clinical index obtained in this study analyzed the frequency statistics and hierarchical clustering analysis to classify new subtypes based on PI. Moreover, the biomarkers and current status of herbal medicine treatment were analyzed using the new subtypes. The results provide comprehensive data to investigate new subtypes and subtype-based biomarkers for the personalized diagnosis and treatment of PD patients. Ethical approval was obtained from the medical ethics committees of the two Korean medicine hospitals. All amendments to the research protocol were submitted and approved. Conclusions: An objective and standardized diagnostic tool is needed for the personalized treatment of PD by traditional Korean medicine. Therefore, we developed a clinical index as the basis for the PI clinical evaluation of PD. Trial Registration: This trial is registered with the Clinical Research Information Service (CRIS) (KCT0008677)

• 한국공간정보시스템학회 논문지
• /
• 제7권3호
• /
• pp.55-65
• /
• 2005

본 논문은 이동체의 잦은 갱신에 의해 발생하는 색인 재구성에 대한 비용을 줄이기 위해 이동체의 지연 다량 삽입 기법을 제안한다. 기존 이동체 색인에 대한 연구는 주로 색인 구성 후에 발생하는 질의 처리 효율성에 초점을 두었다. 이들은 이동체 데이터의 갱신 연산에 의한 색인 재구성에 대한 디스크 접근 오버헤드를 거의 고려하지 않았다. 이러한 이동체 데이터의 갱신 연산에 대한 비용을 줄이기 위해 다량 삽입 기법과 여러 색인이 제안되었다. 하지만 제안된 기법들은 매우 가변적이고 대량인 데이터를 효율적으로 처리하는데 많은 디스크 I/O 비용을 필요로 한다. 본 논문에서는 빠른 데이터 생성 속도에 적합하도록 디스크 접근 오버헤드를 고려해서 R-트리를 관리할 수 있는 현재색인에 대한 다량 삽입 기법을 제안한다. 이 기법에서는 다차원 색인 구조에서의 다량 삽입 기법을 위한 버퍼링 기법을 사용한다. R-트리의 단말 노드 정보를 관리하는 보조 색인을 추가하여 노드의 분할과 합병을 예상한다. 또한 연산을 종류에 따라 분류하여 불필요한 삽입과 삭제 연산을 줄인다. 노드의 변환를 최소화하는 방향으로 이동 객체의 처리 순서를 정하여 데이터 갱신에 따른 노드의 분할과 합병을 최소화한다. 실험을 통해 제안한 기법을 이용한 다량 삽입 기법이 기존의 삽입 기법들보다 색인의 갱신 비용을 감소시키는 것을 알 수 있다.

• 대한산업공학회지
• /
• 제28권3호
• /
• pp.274-282
• /
• 2002

This paper discusses a multi-dimensional analysis for Customer Relationship Management (CRM). For this, We propose a decision-making methodology which employs three analysis models. The first model is a three-dimension positioning map to derive a strategy which achieves the Process Value Line (PVL). The second model is the web-shape analysis model to visibly understand the individual based on the customer CSI (Customer Satisfactory Index) data. The third model which supports the web-shape analysis model, is the relative satisfactory analysis model. It considers a satisfaction level after purchasing against before purchasing. Then we perform overall analysis based on the three analysis models to provide marketing strategies to decision makers.

• 정보처리학회논문지D
• /
• 제16D권4호
• /
• pp.487-496
• /
• 2009

본 연구에서는 대용량 궤적 데이터베이스에서 영역 질의를 효과적으로 처리하기 위한 인덱싱 기법에 대하여 논의한다. 먼저, 기존 인덱싱기법의 문제점을 지적하고, 이러한 문제점을 해결하는 새로운 기법을 제안한다. 제안된 기법에서는 우선 시간 차원을 다수의 시간 구간으로 분할하고, 인덱싱의 대상이 되는 전체 라인 세그먼트들을 시간 구간별로 구분한다. 각 시간 구간에 속하는 라인 세그먼트들에 대하여 별도의 인덱스를 구축한다. 또한, 디스크에서 관리되는 과거 시간 구간에 대한 인덱스들과는 달리 최근 시간 구간에 대한 인덱스는 메인 메모리상에 관리함으로써 삽입과 검색의 성능을 크게 개선할 수 있다. 각 시간 구간에 속하는 라인 세그먼트들은 다음과 같은 방식으로 인덱스를 구축한다. 먼저, 2D-트리를 이용하여 전체 공간 차원을 유사한 수의 라인 세그먼트들이 배정되도록 다수의 셀들로 분할한다. 또한, 분할된 각 셀마다 시공간 차원 (x, y, t)에 대한 별도의 3차원 $R^*$-트리를 두어 보다 상세한 인덱싱을 지원한다. 이와 같은 다양한 전략을 이용함으로써 기존 기법의 문제점들을 해결 할 수 있다. 다양한 실험을 통하여 제안된 기법의 우수성을 정량적으로 검증한다. 실험 결과에 의하면, 기존 기법에 비하여 작은 인덱스 구조를 갖으면서도 검색 성능면에서 3$\sim$10배까지의 성능 향상 효과를 갖는 것으로 나타났다.

• Asia pacific journal of information systems
• /
• 제7권1호
• /
• pp.67-83
• /
• 1997

The utility of learning techniques in investment analysis has been demonstrated in many areas, ranging from forecasting individual stocks to entire market indexes. To date, however, the application of artificial intelligence to financial forecasting has focused largely on short predictive horizons. Usually the forecast window is a single period ahead; if the input data involve daily observations, the forecast is for one day ahead; if monthly observations, then a month ahead; and so on. Thus far little work has been conducted on the efficacy of long-term prediction involving multiperiod forecasting. This paper examines the impact of alternative procedures for extended prediction using knowledge discovery techniques. One dimension in the study involves temporal granularity: a single jump from the present period to the end of the forecast window versus a web of short-term forecasts involving a sequence of single-period predictions. Another parameter relates to the numerosity of input variables: a technical approach involving only lagged observations of the target variable versus a fundamental approach involving multiple variables. The dual possibilities along each of the granularity and numerosity dimensions entail a total of 4 models. These models are first evaluated using neural networks, then compared against a multi-input jump model using case based reasoning. The computational models are examined in the context of forecasting the S&P 500 index.