Browsing by Author "Chiu, Shih-Chuan"

Now showing 1 - 8 of 8

Automatic System for the Arrangement of Piano Reductions
(2009)
Chiu, Shih-Chuan
;
Shan, Man-Kwan
;
Huang, Jiun-Long
;
資訊工程學系
;
Department of Computer Science
Piano reduction is a process that arranges music for the piano by reducing the original music into the most basic components. In this study we present an automatic arrangement system for piano reduction that arranges music algorithmically for the piano while considering various roles of the piano in music. We achieve this by first analyzing the original music in order to determine the type of arrangement element performed by an instrument. Then each phrase is identified and is associated with a weighted importance value. At last, a phrase selection algorithm is proposed to select phrases with maximum importance to arrangement under the constraint of piano playability. Our experiments demonstrate that the proposed system has the ability to create piano arrangement.
Computer music composition based on discovered music patterns
(2006)
Chiu, Shih-Chuan
;
Shan, Man-Kwan
;
資訊工程學系
;
Department of Computer Science
Computer music composition has been the dream of the computer music researcher. In this paper, we investigated the approach to discover the rules of music composition from given music objects, and automatically generate a new music object style similar to the given music objects. The proposed approach utilizes the data mining techniques to discover the rules of music composition characterized by the music properties, music structure, melody style and motif. A new music object is generated based on the discovered rules. To measure the effectiveness of proposed computer music composition approach, we adopted the method similar to the Turing test to test the discrimination between machine-generated and human-composed music. Experimental results showed that it is hard to discriminate. Another experiment showed that the style of generated music is similar to the given music objects.
GPE: A Grid-based Population Estimation Algorithm for Resource Inventory Applications over Sensor Networks
(2009-01-01)
Huang, Jiun-Long
;
Chiu, Shih-Chuan
;
Huang, Xin-Mao
;
資訊工程學系
;
Department of Computer Science
The growing advance in wireless communications and electronics makes the development of low-cost and low-power sensors possible. These sensors are usually small in size and are able to communicate with other sensors in short distance wirelessly. A sensor network consists of a number of sensors which cooperate with one another to accomplish some tasks. In this paper, we address the problem of resource inventory applications, which means a class of applications involving population calculation of a specific object type. To reduce energy consumption, each sensor only reports the number of the sensed objects to the server, and the server will estimate the number of the sensed objects according to the received reports of all sensors. To address this problem, we design in this paper a population estimation scheme, called algorithm GPE (standing for Grid-based Population Estimation), to estimate the numbers of the sensed objects. Several experiments are conducted to measure the performance of algorithm GPE. Experimental results show that algorithm GPE is able to obtain close approximations of the numbers of the sensed objects. In addition, experimental results also show that algorithm GPE is more scalable, and hence, is more suitable than prior schemes for practical use.
Incremental mining of closed inter-transaction itemsets over data stream sliding windows
(2011-04-01)
Chiu, Shih-Chuan
;
Li, Hua-Fu
;
Huang, Jiun-Long
;
You, Hsin-Han
;
資訊工程學系
Mining inter-transaction association rules is one of the most interesting issues in data mining research. However, in a data stream environment the previous approaches are unable to find the result of the new-incoming data and the original database without re-computing the whole database. In this paper, we propose an incremental mining algorithm, called DSM-CITI (Data Stream Mining for Closed Inter-Transaction Itemsets), for discovering the set of all frequent inter-transaction itemsets from data streams. In the framework of DSM-CITI, a new in-memory summary data structure, ITP-tree, is developed to maintain frequent inter-transaction itemsets. Moreover, algorithm DSM-CITI is able to construct ITP-tree incrementally and uses the property to avoid unnecessary updates. Experimental studies show that the proposed algorithm is efficient and scalable for mining frequent inter-transaction itemsets over stream sliding windows.
MINING POLYPHONIC REPEATING PATTERNS FROM MUSIC DATA USING BIT-STRING BASED APPROACHES
(2009)
Chiu, Shih-Chuan
;
Shan, Man-Kwan
;
Huang, Jiun-Long
;
Li, Hua-Fu
;
資訊工程學系
Mining repeating patterns from music data is one of the most interesting issues of multimedia data mining. However, less work are proposed for mining polyphonic repeating patterns. Hence, two efficient algorithms, A-PRPD (priori-based Polyphonic Repeating Pattern Discovery) and T-PRPD (Tree-based Polyphonic Repeating Pattern Discovery), are proposed to discover polyphonic repeating patterns from music data. Furthermore, a bit-string method is developed for improving the efficiency of the proposed algorithms. Experimental results show that the proposed algorithms, A-PRPD and T-PRPD, are both effective and efficient methods for mining polyphonic repeating patterns from synthetic music data and real data.
On Mining Repeating Pattern with Gap Constraint
(2009)
Chiu, Shin-Yi
;
Chiu, Shih-Chuan
;
Huang, Jiun-Long
;
資訊工程學系
;
Department of Computer Science
We in this paper propose a new concept, repeating patterns with gap constraint, to make repeating patterns tolerate the delay of events. To mine repeating patterns with gap constraint, we first show the anti-monotonic property of repeating patterns with gap constraint and then propose a level-wise algorithm, named G-Apriori (standing for Gap with Apriori), based on the anti-monotonic property. Similar to other level-wise mining algorithms such as Apriori, algorithm G-Apriori will scan databases several times to count the number of occurrences of each candidate repeating pattern. Such phenomenon makes G-Apriori spend much time in disk I/O, thereby making G-Apriori not suitable for large databases. In view of this, we develop an index structure to record the positions of the occurrences of each repeating pattern, and then propose algorithm GwI-Apriori (standing for Gap with Index Apriori) to utilize the index structure to reduce the number of database scans when mining repeating patterns with gap constraint. The experimental results show that algorithm GwI-Apriori is more scalable than algorithm G-Apriori in terms of execution time.
On processing continuous frequent K-N-match queries for dynamic data over networked data sources
(2012-06-01)
Chiu, Shih-Chuan
;
Huang, Jiun-Long
;
Huang, Jen-He
;
資訊工程學系
;
Department of Computer Science
Similarity search is one of the critical issues in many applications. When using all attributes of objects to determine their similarity, most prior similarity search algorithms are easily influenced by a few attributes with high dissimilarity. The is proposed to overcome the above problem. However, the prior algorithm to process frequent --match queries is designed for static data, whose attributes are fixed, and is not suitable for dynamic data. Thus, we propose in this paper two schemes to process continuous frequent --match queries over dynamic data. First, the concept of is proposed and four formulae are devised to compute safe regions. Then, scheme CFKNMatchAD-C is developed to speed up the process of continuous frequent --match queries by utilizing safe regions to avoid unnecessary query re-evaluations. To reduce the amount of data transmitted by networked data sources, scheme CFKNMatchAD-C also uses safe regions to eliminate transmissions of unnecessary data updates which will not affect the results of queries. Moreover, for large-scale environments, we further propose scheme CFKNMatchAD-D by extending scheme CFKMatchAD-C to employ multiple servers to process continuous frequent --match queries. Experimental results show that scheme CFKNMatchAD-C and scheme CFKNMatchAD-D outperform the prior algorithm in terms of average response time and the amount of produced network traffic.
Towards an Automatic Music Arrangement Framework Using Score Reduction
(2012-01-01)
Huang, Jiun-Long
;
Chiu, Shih-Chuan
;
Shan, Man-Kwan
;
資訊工程學系
;
Department of Computer Science
Score reduction is a process that arranges music for a target instrument by reducing original music. In this study we present a music arrangement framework that uses score reduction to automatically arrange music for a target instrument. The original music is first analyzed to determine the type of arrangement element of each section, then the phrases are identified and each is assigned a utility according to its type of arrangement element. For a set of utility-assigned phrases, we transform the music arrangement into an optimization problem and propose a phrase selection algorithm. The music is arranged by selecting appropriate phrases satisfying the playability constraints of a target instrument. Using the proposed framework, we implement a music arrangement system for the piano. An approach similar to Turing test is used to evaluate the quality of the music arranged by our system. The experiment results show that our system is able to create viable music for the piano.